Interval Temporal Logic Semantics of Box Algebra

被引:0
作者
Klaudel, Hanna [1 ]
Koutny, Maciej [2 ]
Duan, Zhenhua [3 ]
机构
[1] Univ Evry Val dEssonne, IBISC, F-91037 Evry, France
[2] Newcastle Univ, Sch Comp Sci, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
[3] Xidian Univ, Inst Comp Theory & Technol, Xian 710071, Peoples R China
来源
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014) | 2014年 / 8370卷
基金
英国工程与自然科学研究理事会;
关键词
Interval Temporal Logic; Box Algebra; Petri net; composition; semantics; general synchronisation; step sequence; equivalence; PETRI-NET;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
By focusing on two specific formalisms, viz. Box Algebra and Interval Temporal Logic, we extend the recently introduced translation of Petri nets into behaviourally equivalent logic formulas. We remove restrictions concerning the way in which the control flow of a concurrent system is modelled, and allow for a fully general synchronisation operator. Crucially, we strengthen the notion of equivalence between a Petri net and the corresponding logic formula, by proving such an equivalence at the level of transition based executions of Petri nets, rather than just by considering their labels.
引用
收藏
页码:441 / 452
页数:12
相关论文
共 15 条
  • [1] [Anonymous], 1983, LOGIC OF PROGRAMS
  • [2] Ben-Ari M., 1981, TEMPORAL LOGIC BRANC, P164
  • [3] Best E., 2001, MONO THEOR COMP SCI
  • [4] Cau A, 1997, LECT NOTES COMPUT SC, V1231, P79
  • [5] Desel J., 2001, LNCS, V2128, P1
  • [6] ITL semantics of composite Petri nets
    Duan, Zhenhua
    Klaudel, Hanna
    Koutny, Maciej
    [J]. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2013, 82 (02): : 95 - 110
  • [7] MODEL CHECKING USING NET UNFOLDINGS
    ESPARZA, J
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 1994, 23 (2-3) : 151 - 195
  • [8] LINEAR LOGIC
    GIRARD, JY
    [J]. THEORETICAL COMPUTER SCIENCE, 1987, 50 (01) : 1 - 102
  • [9] Dynamic Access Control Policies: Specification and Verification
    Janicke, H.
    Cau, A.
    Siewe, F.
    Zedan, H.
    [J]. COMPUTER JOURNAL, 2013, 56 (04) : 440 - 463
  • [10] Khomenko V., 2001, CONCUR 2001 - Concurrency Theory. 12th International Conference. Proceedings (Lecture Notes in Computer Science Vol.2154), P366