A context dependent equivalence relation between kripke structures

  • Bernhard Josko
III. Reduction In Finite State Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 531)


In [BCG87] Browne, Clarke and Grumberg define a bisimulation relation on Kripke structure and give a characterization of this equivalence relation in temporal logic. We will generalize their results to reactive systems, which are modelled by Kripke structures together with some constraints describing some requirements how the environment has to interact with the module. Our results subsume the result of [BCM87] by using the constraint true. Furthermore it answers the questions raised in that paper how the equivalence of Kripke structures with fairness constraints can be characterized.


temporal logic Kripke structures bisimulation modular specification reactive systems hierarchical design 

5 References

  1. [BCG87]
    M.C. Browne, E.M. Clarke, O. Grumberg: Charactering Kripke Structures in Temporal Logic. Tech. Report CMU-CS-87-104, Carnegie Mellon University, Pittsburgh (1987)Google Scholar
  2. [Br86]
    M. Browne: An improved algorithm for the automatic verification of finite state systems using temporal logic. Symp. Logics in Computer Science, pp. 260–266, 1986Google Scholar
  3. [DD89]
    W. Damm, G. Döhmen: AADL: A net based specification method for computer architecture design. in: de Bakker (Ed.): Languages for Parallel Architectures: Design, Semantics, and Implementation Models. Wiley & Sons, 1989Google Scholar
  4. [DDGJ90]
    W. Damm, G. Döhmen, V. Gerstner, B. Josko: Modular verification of Petri nets: The temporal logic approach. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, LNCS 430, pp. 180–207, 1990Google Scholar
  5. [EH86]
    E.A. Emerson, J.Y. Halpern: "Sometimes" and "not never" revisited: On branching versus linear time temporal logic. Journal of the ACM 33, pp. 151–178, 1986Google Scholar
  6. [Jo90]
    B. Josko: Verifying the correctness of AADL modules using model checking. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, LNCS 430, pp. 386–400, 1990Google Scholar
  7. [Kr87]
    F. Kröger: Temporal Logic of Programs. EATCS-Monographs, Springer, 1987Google Scholar
  8. [La86]
    K.G. Larsen: Context-dependent bisimulation between processes. Ph.D. Thesis, Edinburgh, 1986Google Scholar
  9. [LM87]
    K.G. Larsen, R. Milner: Verifying a protocol using relativized bisimulation. ICALP 87, LNCS 267, pp. 126–135, 1987Google Scholar
  10. [LP85]
    O. Lichtenstein, A. Pnueli: Checking that finite state concurrent programs satisfy their linear specification. 12th ACM Symp. on Principles of Programming Languages, pp. 97–107, 1985Google Scholar
  11. [Mi83]
    R. Milner: Calculi for synchrony and asynchrony. TCS 25, 1983Google Scholar
  12. [Pa81]
    D. Park: Concurrency and automata on infinite sequences. LNCS 104, pp167–183, 1981Google Scholar
  13. [Pn77]
    A. Pnueli: The temporal logic of programs. 18th Annual Symposium on Foundations of Computer Science, 1977Google Scholar
  14. [Pn85]
    A. Pneuli: Linear and branching structures in the semantics and logics of reactive systems. ICALP 85, LNCS 194, 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Bernhard Josko
    • 1
  1. 1.Computer Science DepartmentUniversity of OldenburgOldenburgGermany

Personalised recommendations