ITL semantics of composite Petri nets - Archive ouverte HAL
Article Dans Une Revue Journal of Logic and Algebraic Programming Année : 2013

ITL semantics of composite Petri nets

Résumé

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.

Dates et versions

hal-00781438 , version 1 (26-01-2013)

Identifiants

Citer

Zhenhua Duan, Hanna Klaudel, Maciej Koutny. ITL semantics of composite Petri nets. Journal of Logic and Algebraic Programming, 2013, 82 (2), pp.95--110. ⟨10.1016/j.jlap.2012.12.001⟩. ⟨hal-00781438⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

More