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.KeywordsProgram logicμ-calculuscompositional proof methodsprocess algebraadequacyexpressivity
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
