ITL semantics of composite Petri nets

被引:2
|
作者
Duan, Zhenhua [1 ]
Klaudel, Hanna [2 ]
Koutny, Maciej [3 ]
机构
[1] Xidian Univ, Sch Comp Sci & Engn, Xian, Peoples R China
[2] Univ Evry Val dEssonne, IBISC, F-91000 Evry, France
[3] Newcastle Univ, Sch Comp Sci, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
来源
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING | 2013年 / 82卷 / 02期
基金
英国工程与自然科学研究理事会;
关键词
ITL; Petri net; Box algebra; Composition; Semantics; TEMPORAL LOGIC;
D O I
10.1016/j.jlap.2012.12.001
中图分类号
学科分类号
摘要
Interval temporal logic (ITL) and Petri nets are two well developed formalisms for the specification and analysis of concurrent systems. ITL allows one to specify both the system design and correctness requirements within the same logic based on intervals (sequences of states). As a result, verification of system properties can be carried out by checking that the formula describing a system implies the formula describing a requirement. Petri nets, on the other hand, have action and local state based semantics which allows for a direct expression of causality aspects in system behaviour. As a result, verification of system properties can be carried out using partial order reductions or invariant based techniques. In this paper, we investigate a basic semantical link between temporal logics and compositionally defined Petri nets. In particular, we aim at providing a support for the verification of behavioural properties of Petri nets using methods and techniques developed for ITL. (c) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:95 / 110
页数:16
相关论文
共 50 条
  • [1] From Petri Nets with Shared Variables to ITL
    Klaudel, Hanna
    Koutny, Maciej
    Moszkowski, Ben
    2016 16TH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD 2016), 2016, : 11 - 18
  • [2] On Petri nets semantics for π-calculus
    School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, China
    不详
    Kongzhi yu Juece Control Decis, 2007, 8 (864-868):
  • [3] ACP SEMANTICS FOR PETRI NETS
    Simonak, Slavomir
    Tomasek, Martin
    COMPUTING AND INFORMATICS, 2018, 37 (06) : 1464 - 1484
  • [4] Complete Process Semantics of Petri Nets
    Juhas, Gabriel
    Lorenz, Robert
    Mauser, Sebastian
    FUNDAMENTA INFORMATICAE, 2008, 87 (3-4) : 331 - 365
  • [5] Token Trail Semantics - Modeling Behavior of Petri Nets with Labeled Petri Nets
    Bergenthum, Robin
    Folz-Weinstein, Sabine
    Kovar, Jakub
    APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2023, 2023, 13929 : 286 - 306
  • [6] Interval semantics for Petri nets with inhibitor arcs
    Alqarni, Mohammad
    Janicki, Ryszard
    THEORETICAL COMPUTER SCIENCE, 2018, 727 : 1 - 23
  • [7] A compositional petri nets semantics for basic lotos
    Department of Computer Science, USTO, Algeria
    Inf. Technol. J., 2007, 1 (110-116): : 110 - 116
  • [8] Unfolding Semantics of Petri Nets Based on Token Flows
    Bergenthum, Robin
    Mauser, Sebastian
    Lorenz, Robert
    Juhas, Gabriel
    FUNDAMENTA INFORMATICAE, 2009, 94 (3-4) : 331 - 360
  • [9] Basic Server Semantics and Performance Monotonicity of Continuous Petri Nets
    Cristian Mahulea
    Laura Recalde
    Manuel Silva
    Discrete Event Dynamic Systems, 2009, 19 : 189 - 212
  • [10] Token Trail Semantics II - Petri Nets And Their Net Language
    Kovar, Jakub
    Bergenthum, Robin
    APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2024, 2024, 14628 : 175 - 196