Safe reasoning with Logic LTS

Previous work has introduced the setting of Logic LTS, together with a variant of ready simulation as fully-abstract refinement preorder, which allows one to compose operational specifications using a CSP-style parallel operator as well as the propositional connectives conjunction and disjunction. In this paper, we show how a temporal logic for specifying safety properties may be embedded into Logic LTS so that (a) the temporal operators are compositional for ready simulation and (b) ready simulation, when restricted to pairs of processes and formulas, coincides with the logic’s satisfaction relation. The utility of this setting as a semantic foundation for mixed operational and temporal-logic specification languages is demonstrated via a simple example.

[1]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[2]  Irek Ulidowski,et al.  Refusal Simulation and Interactive Games , 2002, AMAST.

[3]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[4]  Bloom Bard,et al.  Ready simulation, bisimulation, and the semantics of CCS-like languages , 1989 .

[5]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[6]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[7]  Harald Fecher,et al.  Finite abstract models for deterministic transition systems: fair parallel composition and refinement-preserving logic , 2007, FSEN'07.

[8]  Rocco De Nicola,et al.  Action versus State based Logics for Transition Systems , 1990, Semantics of Systems of Concurrent Processes.

[9]  Antti Valmari,et al.  Liveness and Fairness in Process-Algebraic Verification , 2001, CONCUR.

[10]  Walter Vogler,et al.  Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics , 2006, FoSSaCS.

[11]  José Félix Costa,et al.  Processes with local and global liveness requirements , 2009, J. Log. Algebraic Methods Program..

[12]  Thomas A. Henzinger,et al.  Fair Bisimulation , 2000, TACAS.

[13]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[14]  Martín Abadi,et al.  A Logical View of Composition , 1993, Theor. Comput. Sci..

[15]  Walter Vogler,et al.  Conjunction on processes: Full abstraction via ready-tree semantics , 2007, Theor. Comput. Sci..

[16]  Walter Vogler,et al.  Ready simulation for concurrency: It's logical! , 2007, Inf. Comput..

[17]  E.-R. Olderog,et al.  Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science) , 2005 .

[18]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .