Abstract
Showing equivalence of two systems at different levels of abstraction often entails mapping a single step in one system to a sequence of steps in the other, where the relevant state information does not change until the last step. In [BCG 88,dNV 90], bisimulations that take into account such “stuttering” are formulated. These definitions are, however, difficult to use in proofs of bisimulation, as they often require one to exhibit a finite, but unbounded sequence of transitions to match a single transition; thus introducing a large number of proof obligations. We present an alternative formulation of bisimulation under stuttering, in terms of a ranking function over a well-founded set. It has the desirable property, shared with strong bisimulation [Mil 90], that it requires matching single transitions only, which considerably reduces the number of proof obligations. This makes proofs of bisimulation short, and easier to demonstrate and understand. We show that the new formulation is equivalent to the original one, and illustrate its use with non-trivial examples that have infinite state spaces and exhibit unbounded stuttering.
This work was supported in part by SRC Contract 96-DP-388.
Preview
Unable to display preview. Download preview PDF.
References
Apt, K. R., Olderog, E-R. Verification of Sequential and Concurrent Programs, Springer-Verlag, 1991.
Browne, M. C., Clarke, E. M., Grumberg, O. Characterizing Finite Kripke Structures in Propositional Temporal Logic, Theor. Comp. Sci., vol. 59, pp. 115–131, 1988.
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.
Clarke, E.M., Filkorn, T., Jha, S. Exploiting Symmetry in Temporal Logic Model Checking, 5th CAV, Springer-Verlag LNCS 697.
Emerson, E. A., Halpern, J. Y. “Sometimes” and “Not Never” Revisited: On Branching versus Linear Time Temporal Logic. in POPL, 1982.
Emerson, E.A., Namjoshi, K.S. Reasoning about Rings. in POPL, 1995.
Emerson, E.A., Sistla, A.P. Symmetry and Model Checking, 5th CAV, Springer-Verlag LNCS 697.
Francez, N. Fairness, Springer-Verlag, 1986.
van Glabbeek, R. J., Weijland, W. P. Branching time and abstraction in bisimulation semantics. in Information Processing 89, Elsevier Science Publishers, North-Holland, 1989.
Grumberg, O., Francez, N., Makowski, J., de Roever, W-P. A proof rule for fair termination, in Information and Control, 1983.
Klarlund, N., Kozen, D. Rabin measures and their applications to fairness and automata theory. in LICS, 1991.
Lamport, L. “Sometimes” is Sometimes “Not Never”, in POPL, 1980.
Milner, R. Communication and Concurrency, Prentice-Hall International Series in Computer Science. Edited by C.A.R. Hoare.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Namjoshi, K.S. (1997). A simple characterization of stuttering bisimulation. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058037
Download citation
DOI: https://doi.org/10.1007/BFb0058037
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63876-6
Online ISBN: 978-3-540-69659-9
eBook Packages: Springer Book Archive