CAV 1991: Computer Aided Verification pp 454-465 | Cite as

An algebra of Boolean processes

  • Costas Courcoubetis
  • Susanne Graf
  • Joseph Sifakis
Session 15: Automata
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 575)

Abstract

This work has been motivated by the study of the S/R models which allow to represent systems as a set of communicating state machines cooperating through a shared memory.

We show that S/R models can be expressed in terms of a process algebra called Boolean SCCS which is a special case of Milner's SCCS, in the sense that the actions are elements of some boolean algebra. We define for Boolean SCCS an operational and a symbolic semantics modulo strong bisimulation equivalence. A complete axiomatisation of bisimulation and simulation equivalences on this algebra is proposed.

Furthermore, we propose a very general renaming operator, and show by means of examples that it allows the definition of abstractions.

Keywords

Boolean Algebra Shared Memory Operational Semantic Parallel Composition Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABM86a]
    S. Aggarwal, D. Barbara, K. Z. Meth. “SPANNER-A Tool for the Specification, Analysis, and Evaluation of Protocols,” IEEE Trans. on Software Engineering (to appear).Google Scholar
  2. [AC85]
    S. Aggarwal, C. Courcoubetis. “Distributed Implementation of a Model of Communication and Computation,” Proceedings of the Int. Conf. on System Sciences, January, 1985.Google Scholar
  3. [AKS83a]
    S. Aggarwal, R. P. Kurshan, K. K. Sabnani. “A Calculus for Protocol Specification and Validation,” in Protocol Specification, Testing and Verification III, North-Holland, 1983.Google Scholar
  4. [Ku90]
    R. Kurshan, “Analysis of Discrete Event Coordination”. LNCS 430 (1990).Google Scholar
  5. [ACW90]
    S. Aggarwal, C. Courcoubetis, P. Wolper. “Adding Liveness Properties to Coupled Finite-State Machines”, ACM TOPLAS, Vol. 12, No 2, April 1990.Google Scholar
  6. [GK80]
    B. Gopinath, B. Kurshan. “The Selection/Resolution Model for Coordinating Concurrent Processes”, AT&T Bell Laboratories Technical Report.Google Scholar
  7. [KK86]
    J. Katzenelson, B. Kurshan, “S/R: A Language for Specifying Protocols and other Coordinating Processes”, Proc. 5th Ann. Int'l Phoenix Conf. Comput. Commun., IEEE, 1986.Google Scholar
  8. [BGFRS90]
    A. Bouajjani, J.-C. Fernandez, S. Graf, C. Rodriguez, J. Sifakis. Safety for Branching Semantics, ICALP 91, Madrid, LNCS Vol. 510, 1991.Google Scholar
  9. [Ma91]
    F. Maraninchi. Argos: a graphical synchronous language for the description of reactive systems, Report Spectre C-29, Grenoble, March 91, submitted to SCPGoogle Scholar
  10. [Mi80]
    R. Milner. A Calculus for Communicating Systems, LNCS 92, 1980Google Scholar
  11. [Mi83]
    R. Milner. Calculi for Synchrony and Asynchrony, Theoret. Comp. Sci. 25, 1983.Google Scholar
  12. [Mi84]
    R. Milner. A Complete Inference System for a Class of Regular Behaviours, Journal of Comp. and Syst. Sci. Vol. 28, 1984Google Scholar
  13. [Mi89]
    R. Milner. Communication and Concurrency, Prentice Hall, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Costas Courcoubetis
    • 1
  • Susanne Graf
    • 2
  • Joseph Sifakis
    • 2
  1. 1.Department of Computer ScienceUniversity of CreteHeraklionGreece
  2. 2.IMAG-LGIGrenoble

Personalised recommendations