An efficient algorithm for branching bisimulation and stuttering equivalence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 443 LNCS, Issue , 1990, Pages 626-638

  Groote, Jan Friso ^a   Vaandrager, Frits ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BRANCHING BISIMULATION; FINITE STATE; KRIPKE STRUCTURE; LABELLED TRANSITION SYSTEMS; NUMBER OF STATE; SPACE COMPLEXITY; TIME ALGORITHMS; TIME COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 54249140950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032063     Document Type: Conference Paper

References (18)

1. A.V. Aho, J.E. Hopcroft & J.D. Ullman (1974): The design and analysis of computer algorithms, Addison-Wesley.
2. T. Bolognesi & S.A. Smolka (1987): Fundamental results for the verification of observational equivalence: a survey. In: Proceedings 7th IFIP WG6.1 International Symposium on Protocol Specification, Testing, and Verification, Zürich, Switserland, May 1987 (H. Rudin & C. West, eds.), North-Holland.
3. M.C. Browne, E.M. Clarke & O. Grumberg (1988): Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science 59(1, 2), pp. 115–131.
4. E.M. Clarke & E.A. Emerson (1981): Synthesis of synchronization skeletons for branching time temporal logic. In: Proceedings of the Workshop on Logic of Programs, Springer-Verlag, pp. 52–71.
5. E.M. Clarke & O. Grumberg (1987): Research on automatic verification of finite state concurrent systems. Ann. Rev. Comput. Sci. 2, pp. 269–290.
6. E.M. Clarke, D.E. Long & K.L. McMillan (1989): Compositional model checking. In: Proceedings 4th Annual Symposium on Logic in Computer Science (LICS), Asilomar, California, IEEE Computer Society Press, Washington, pp. 353–362.
7. th ACM Symposium on Theory of Computing, New York City, NY, pp. 1–6.
8. R. De Nicola, U. Montanari & F.W. Vaandrager (1990): Back and forth bisimulations, submitted for publication.
9. R. De Nicola & F.W. Vaandrager (1990): Three logics for branching bisimulation, to appear as: CWI Report CS-R90… Extended abstract to appear in: Proceedings LICS 90.
10. E.A. Emerson & J.Y. Halpern (1986): ‘sometimes’ and ‘Not Never’ revisited: on branching time versus linear time temporal logic. JACM 33(1), pp. 151–178.
11. J.C. Fernandez (1989): An implementation of an efficient algorithm for bisimulation equivalence.
12. R.J. van Glabbeek & W.P. Weijland (1989): Branching time and abstraction in bisimulation semantics (extended abstract). In: Information Processing 89 (G.X. Ritter, ed.), Elsevier Science Publishers B.V. (North Holland), pp. 613–618.
13. R.J. van Glabbeek & W.P. Weijland (1989): Refinement in branching time semantics. Report CS-R8922, Centrum voor Wiskunde en Informatica, Amsterdam, also appeared in: Proceedings AMAST Conference, May 1989, Iowa, USA, pp. 197–201.
14. nd ACM Symposium on Principles of Distributed Computing (PODC), Montreal, Quebec, Canada, August 1983, to appear in: Information & Computation.
15. L. Lamport (1983): What good is temporal logic?. In: Information Processing 83 (R.E. Mason, ed.), Elsevier Science Publishers B.V. (North Holland), pp. 657–668.
16. R. Milner (1980): A Calculus of Communicating Systems, LNCS 92, Springer-Verlag.
17. R. Paige & R. Tarjan (1987): Three partition refinement algorithms. SIAM Journal on Computing 16(6), pp. 973–989.
18. R. de Simone & D. Vergamini (1989): Aboard AUTO. Technical Report 11, INRIA, Centre Sophia-Antipolis, Valbonne Cedex.