Skip to main content
SpringerLink
Log in

Equivalences and preorders of transition systems

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

Abstract

Two transition systems are logically equivalent if they satisfy the same formulas of a given logic. For some of these logics, such as Hennessy-Milner's logic, there is an algebraic characterization of this equivalence involving particular homomorphisms of transition systems. This logical equivalence is associated with a preorder: a transition system S is less than S' if all formulas satisfied by S are satisfied by S'. For particular logics, this preorder can also be algebraically characterized, using homomorphisms and a specific notion of inclusion of transition systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold. Systèmes de transitions finis et sémantique des processus communicants. Masson, 1992.

    Google Scholar 

  2. A. Arnold, A. Dicky. An Algebraic Characterization of Transition System Equivalences. Information and Computation, 82:198–229, 1989.

    Google Scholar 

  3. G. Boudol, K. Larsen. Graphical versus Logical Specifications. Theor. Comput. Sci.,106:3–20, 1992

    Google Scholar 

  4. P. Degano, R. De Nicola, U. Montanari. A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Acta Informatica, 26:59–91, 1988.

    Google Scholar 

  5. R. De Nicola, F. Vaandrager. Three Logics for Branching Bisimulation. in: Proc. of LICS '90(1990)118–129.

    Google Scholar 

  6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logics specifications. ACM Trans. Prog. Lang. Syst., 8:244–263, 1986.

    Google Scholar 

  7. E. A. Emerson and J. Y. Halpern. “Sometimes” and “Not Never” revisited: on branching versus linear time temporal logic. J. Assoc. Comput. Mach., 33:151–178, 1986.

    Google Scholar 

  8. E. A. Emerson and A. P. Sistla. Deciding full branching time logic. Information and Control, 61:175–201, 1984.

    Google Scholar 

  9. M. Hennessy, R.Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach., 32:137–161, 1985.

    Google Scholar 

  10. M. Hennessy, C. Stirling. The power of the future perfect in program logics. in: 11th Math. Foundations of Comput. Sci, 1984. Lect. Notes Comput. Sci. 176(1984)301–311.

    Google Scholar 

  11. K. Larsen, B. Thomsen. A Modal Process Logic. in: Proc. of LICS '88(1988)203–210.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI Université Bordeaux I, France

    A. Arnold & A. Dicky

  2. IUT La Rochelle, France

    A. Dicky

Authors
  1. A. Arnold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Dicky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnold, A., Dicky, A. (1993). Equivalences and preorders of transition systems. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation