A simple characterization of stuttering bisimulation

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

Volumn 1346, Issue , 1997, Pages 284-296

  Namjoshi, Kedar S ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMULATIONS; INFINITE STATE SPACE; LEVELS OF ABSTRACTION; PROOF OBLIGATIONS; RANKING FUNCTIONS; SINGLE-STEP; STATE INFORMATION; STRONG BISIMULATION;

SOFTWARE ENGINEERING;

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

References (15)

1. Apt, K. R., Olderog, E-R. Verification of Sequential and Concurrent Programs, Springer-Verlag, 1991.
2. Browne, M. C., Clarke, E. M., Grumberg, O. Characterizing Finite Kripke Structures in Propositioned Temporal Logic, Theor. Comp. Sci., vol. 59, pp. 115-131, 1988.
3. Browne, M. C., Clarke, E. M., Grumberg, O. Reasoning about Networks with Many Identical Finite State Processes, Information and Computation, vol. 81, no. 1, pp. 13-31, April 1989.
4. Clarke, E.M., Filkom, T., Jha, S. Exploiting Symmetry in Temporal Logic Model Checking, 5th CAV, Springer-Verlag LNCS 697.
5. Emerson, E. A., Halpem, J. Y. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic, in POPL, 1982.
6. Emerson, E.A., Namjoshi, K.S. Reasoning about Rings, in POPL, 1995.
7. Emerson, E.A., Sistla, A.P. Symmetry and Model Checking, 5th CAV, Springer-Verlag LNCS 697.
8. Francez, N. Fairness, Springer-Verlag, 1986.
9. ven Glabbeek, R. J., Weijland, W. P. Branching time eind abstraction in bisimulation sememtics. in Information Processing 89, Elsevier Science Publishers, North-Holleind, 1989.
10. Grumberg, O., Francez, N., Makowski, J., de Roever, W-P. A proof rule for fair termination, in Information and Control, 1983.
11. Klarlund, N., Kozen, D. Rabin meeisures and their applications to fairness and automata theory, in LICS, 1991.
12. Lamport, L. "Sometimes" is Sometimes "Not Never", in POPL, 1980.
13. Milner, R. Communication and Concurrency, Prentice-Hall International Series in Computer Science. Edited by C.A.R. Hoare.
14. de Nicola, R., Vaandrager, F. Three logics for branching bisimulation, in LICS, 1990. Full version in Journal of the ACM, 42(2):458-487, 1995.
15. Vardi, M. Verification of Concurrent Programs - The Automata Theoretic Framework, in LICS, 1987. Full version in Annals of Pure and Applied Logic, 51:79-98, 1991.