Action and state-based logics for process algebras

  • Rocco De Nicola
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 527)


Process algebras are generally recognized as a convenient tool for describing concurrent systems at different levels of abstraction. They rely on a small set of basic operators which correspond to primitive notions on concurrent systems and on one or more notions of behavioural equivalence or preorder. The operators are used to build complex systems from more elementary ones. The behavioural equivalences are used to study the relationships between different descriptions of the same system at different levels of abstractions and thus to perform part of the analysis.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    De Nicola,R. and Vaandrager,F.W.: Three Logics for Branching Bisimulations (Extended Abstract) in LICS '90, Philadelphia, USA, June 1990, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 118–129. Full paper appeared as CWI Report CS-R9012, 1990.Google Scholar
  2. [2]
    De Nicola, R. and Vaandrager, F.W.: Action versus State based Logics for Transition Systems. In Proceedings Ecole de Printemps on Semantics of Concurrency, April 1990, (I. Guessarian ed.), Lecture Notes in Computer Science 469, 1990, pp. 407–419.Google Scholar
  3. [3]
    De Nicola,R., Fantechi,A., Gnesi,S. and Ristori,G.: An action-based framework for verifying logical and behavioural properties of concurrent systems. In Proc. of 3rd Workshop on Computer Aided Verification, Lecture Notes in Computer Science, Springer Verlag, 1991, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Rocco De Nicola
    • 1
  1. 1.Scienze dell'InformazioneUniversità “La Sapienza”, RomaRomaITALY

Personalised recommendations