An Expressive Logic for Basic Process Algebra

In this paper we present a branching time temporal logic for Basic Process Algebra. This logic is an enrichment of the branching temporal logic CTL with a branching sequential composition operator, named chop branching. The logic so obtained is proved to be expressive with respect to the bisimulation semantics defined on BPAδ, rec terms, and is able to describe context-free properties of systems.

[1]  Bengt Jonsson,et al.  Implementing a Model Checking Algorithm by Adapting Existing Automated Tools , 1989, Automatic Verification Methods for Finite State Systems.

[2]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[3]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[4]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[5]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[6]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.

[7]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[8]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[11]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[12]  S. Graf,et al.  A Logic for the Specification and Proof of Controllable Processes of CCS , 1989, Logics and Models of Concurrent Systems.

[13]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[14]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[15]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[16]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[17]  Hans Hüttel,et al.  Actions speak louder than words: proving bisimilarity for context-free processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[18]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[19]  Jan A. Bergstra,et al.  Process algebra: specification and verification in bisimulation semantics , 1986 .

[20]  Stefania Gnesi,et al.  Compositionality and Bisimulation: A Negative Result , 1991, Inf. Process. Lett..