Temporal logics for CCS

Transition systems are focal structures in the study of concurrent systems. On the one hand they are used for defining operational semantics of such systems. And on the other hand they are fundamental structures for interpreting modal and temporal logics. Here we consider different transition systems associated with Milner's Calculus of Communicating Systems (CCS), these differ according to how silent actions are treated. Then a general framework for modal and temporal logics is outlined. Within this framework modal and temporal mu-calculi are highlighted, logics that are appropriate for describing CCS processes. Finally, the equivalences induced by these logics on processes is examined, in general terms.

[1]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1985, Inf. Control..

[2]  D. J. Walker,et al.  Bisimulations and divergence , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[4]  Jan A. Bergstra,et al.  Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator , 1987, Comput. J..

[5]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[6]  Mordechai Ben-Ari,et al.  The Temporal Logic of Branching Time , 1981, POPL.

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

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

[9]  E. A Emerson,et al.  Using Branching Time Logic to Synthesize Synchronization Skeletons , 1982 .

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

[11]  Kim G. Larsen,et al.  Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.

[12]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[13]  Joseph Sifakis,et al.  A Unified Approach for Studying the Properties of Transition Systems , 1982, Theor. Comput. Sci..

[14]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

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

[16]  Vaughan R. Pratt,et al.  A decidable mu-calculus: Preliminary report , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[17]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..