Abstract
We present two logic LSP (Logic of Sequential Processes) and LP (Logic of Processes) which are propositional μ-calculi with both logical operators and standard operators of process algebras such as prefixing, non-deterministic choice, parallel composition and restriction. The process algebra operators are extended on unions of bisimulation classes.
LSP is an extension of an algebra of sequential processes with strong bisimulation. A deductive system is proposed for this logic and a comparison with the propositional μ-calculus of Kozen is carried out.
LP is an extension of an algebra of communicating processes with strong bisimulation. A deductive system is proposed for this logic and its use is illustrated by an example.
(Extended Abstract)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Clarke E.M., Emerson E.A., Sistla A.P. Automatic Verification of Finite State Concurrent Systems Using Temporal Logic, 10th Annual ACM Symp. on Principles of Programming Languages, 1983.
Emerson E.A., Halpern J.Y. "Sometimes" and "Not Never" Revisited: on Branching versus Linear Time, 10th Annual ACM Symp. on Principles of Programming Languages, 1983.
Emerson E.A., Lei C-L. Efficient Model Checking in Fragments of the Propositional Mu-Calculus, LICS 1986.
Graf S., Sifakis J. A Modal Characterisation of Observational Congruence of Finite Terms of CCS, Information and Control Vol.68, 1–3, 1986.
Graf S., Sifakis J. A Logic for the Specification and Proof of Controllable Terms of CCS, Acta Informatica 23, 1986.
Graf S., Sifakis J. A Logic for the Description of Non-deterministic Programs and their Properties, Information and Control Vol.68, 1–3, 1986.
Hennessy M., Milner R. Observing Non-determinism and Concurrency, Proceedings of 7th ICALP, LNCS 92, 1982.
Kozen D. Results on the Propositional μ-calculus, TCS 27, 1983.
Kozen D., Parikh R. J. A decision Procedure for the Propositional Mu-calculus, Second Workshop on Logics of Programs, 1983.
Milner R. A Calculus of Communicating Systems, LNCS 92, 1980.
Milner R. A Complete Inference System for a Class of Regular Behaviours, JCSS 28, 439–466, 1984.
Pnueli A. Linear and Branching Time Structures in the Semantics and Logics of Reactive Systems, Proceedings of ICALP, LNCS 194, 1986.
Pnueli A. Specification and Development of Reactive Systems, Proceedings IFIP 1986.
Sifakis J. A Response to Amir Pnueli's "Specification and Development of Reactive Systems", Proceedings IFIP 1986.
Streett R.S., Emerson E.A. The propositional Mu-calculus is Elementary, Proc. 12th ICALP, LNCS 172, 465–472, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouajjani, A., Graf, S., Sifakis, J. (1989). A logic for the description of behaviours and properties of concurrent systems. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. REX 1988. Lecture Notes in Computer Science, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013027
Download citation
DOI: https://doi.org/10.1007/BFb0013027
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51080-2
Online ISBN: 978-3-540-46147-0
eBook Packages: Springer Book Archive