From Box Algebra to Interval Temporal Logic

In this paper, we further develop a recently introduced semantic link between temporal logics and Petri nets. We focus on two specific formalisms, Interval Temporal Logic (ITL) and Box Algebra (BA), which are closely related by their compositional approach to constructing system descriptions. The overall goal of our investigation is to translate Petri nets into behaviourally equivalent logical formulas. As a result, the analysis of system properties can be carried out using either of the two formalisms, exploiting their respective strengths and powerful tool support. The contribution of this paper is twofold. First, we extend the existing translation from BA to ITL, by removing restrictions concerning the way control flow of concurrent system is modelled, and by allowing a fully general synchronisation operator. Second, we strengthen the notion of equivalence between a Petri net and the corresponding logical formula by proving such an equivalence at the level of transition-based executions of Petri nets rather than just by looking at their labels. We also show that the complexity of the proposed translation compares favourably with the complexity of the translation from BA expressions to Petri nets.

[1]  Elisabeth Pelz,et al.  A Logical Approach of Petri Net Languages , 1985, Theor. Comput. Sci..

[2]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[3]  Zohar Manna,et al.  Verification of Concurrent Programs: Temporal Proof Principles , 1981, Logic of Programs.

[4]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[5]  Sven Linker,et al.  Proof Theory of a Multi-Lane Spatial Logic , 2015, Log. Methods Comput. Sci..

[6]  Angelo Montanari,et al.  Interval vs. Point Temporal Logic Model Checking , 2017, ACM Trans. Comput. Log..

[7]  Manuel Silva Suárez,et al.  Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems , 1996, Petri Nets.

[8]  Ben C. Moszkowski,et al.  Executing temporal logic programs , 1986, Seminar on Concurrency.

[9]  Maciej Koutny,et al.  Interval Temporal Logic Semantics of Box Algebra , 2014, LATA.

[10]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[11]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[12]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[13]  Hussein Zedan,et al.  Refining Interval Temporal Logic Specifications , 1997, ARTS.

[14]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[15]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[16]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[17]  David de Frutos-Escrig,et al.  A congruence relation for sPBC , 2008, Formal Methods Syst. Des..

[18]  Angelo Montanari,et al.  Checking interval properties of computations , 2014, Acta Informatica.

[19]  Maciej Koutny,et al.  ITL semantics of composite Petri nets , 2013, J. Log. Algebraic Methods Program..

[20]  Alessio Lomuscio,et al.  Decidability of model checking multi-agent systems against a class of EHS specifications , 2014, ECAI.

[21]  Hussein Zedan,et al.  Dynamic Access Control Policies: Specification and Verification , 2013, Comput. J..

[22]  Jörg Desel,et al.  ''What Is a Petri Net?'' , 2001, Unifying Petri Nets.

[23]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[24]  Maciej Koutny,et al.  Towards an Efficient Algorithm for Unfolding Petri Nets , 2001, CONCUR.

[25]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[26]  Martin Leucker,et al.  Guest editors’ preface to special issue on interval temporal logics , 2014, Annals of Mathematics and Artificial Intelligence.

[27]  Ben C. Moszkowski,et al.  Compositional reasoning about projected and infinite time , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[28]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[29]  Alessio Lomuscio,et al.  An Epistemic Halpern-Shoham Logic , 2013, IJCAI.

[30]  Hanna Klaudel,et al.  M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages , 1998, Acta Informatica.

[31]  Wolfgang Reif,et al.  Proving linearizability with temporal logic , 2009, Formal Aspects of Computing.

[32]  Valentin Goranko,et al.  A Road Map of Interval Temporal Logics and Duration Calculi , 2004, J. Appl. Non Class. Logics.

[33]  Helge Janicke,et al.  Verification and enforcement of access control policies , 2013, Formal Methods Syst. Des..

[34]  Zohar Manna,et al.  Reasoning in Interval Temporal Logic , 1983, Logic of Programs.

[35]  Tadao Murata,et al.  Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs , 1989, IEEE Trans. Software Eng..

[36]  Maciej Koutny,et al.  From Petri Nets with Shared Variables to ITL , 2016, 2016 16th International Conference on Application of Concurrency to System Design (ACSD).