Abstract
We study in a first part of this paper safety and liveness properties for any given program semantics. We give a topological definition of these properties using a safety preorder. Then, we consider the case of branching time semantics where a program is modeled by a set of infinite computation trees modulo bisimulation. We propose and study a safety preorder for this semantics based on simulation and dealing with silent actions. We focus on regular safety properties and characterize them by both tree-automata and formulas of a branching time logic. We show that verifying safety properties on trees reduces to simulation testing.
This work was partially supported by ESPRIT Basic Research Action “SPEC”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and L. Lamport. The existence of refinement mappings. SRC 29, Digital Equipement Corporation, August 1988.
B. Alpern and F.B. Schneider. Recognizing safety and liveness. Distributed Computing, 2:117–126, 1987.
J. A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. TCS, 37 (1), 1985.
G. Boudol. Notes on algebraic calculi of processes. In Logics and Models for Concurrent Systems, Springer Verlag, 1985. Nato ASI Series F (13).
J.R. Büchi. On a decision method in restricted second order arithmetic. In Nagel et al., editor, Logic, Methodology and Philosophy of Sciences, Stantford Univ. Press, 1962.
R. Cohen and A. Gold. Theory of ω-languages. J. Comput. System Sci., 15:169–208, 1977.
S. Chaudhuri and R.E. Ladner. Safety and Liveness of ω-Context-Free Languages. Technical Report 88-11-04, Department of Computer Sciences and Engineering, University of Washington, Seatle, Washington, 1989.
J. C. Fernandez. Aldébaran: A tool for verification of communicating processes. Tech. report Spectre C14, LGI-IMAG Grenoble, 1989.
J. Fernandez and L. Mounier. Verification bisimulations on the fly. In Proceedings of the Third International Conference on Formal Description Techniques FORTE'90 (Madrid, Spain), pages 91–105, North-Holland, November 1990.
Jan Friso Groote and Frits Vaandrager. An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. CS-R 9001, Centrum voor Wiskunde en Informatica, Amsterdam, January 1990.
R. Hossley and C. Rackoff. The emptiness problem for automata on infinite trees. In Proc. 13th IEEE Symp. on Switching and Automata Theory, 1972.
D. Kozen. Results on the propositional μ-calculus. In Theoretical Computer Science, North-Holland, 1983.
L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, SE-3(2):125–143, 1977.
L. Lamport. Logical foundation. In M. Paul and H.J. Siegert, editors, Distributed Systems-Methods and Tools for Specification, LNCS 190, Springer Verlag, 1985.
O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Conference on Logics of Programs, LNCS 194, Springer Verlag, 1985.
R. Milner. An algebraic definition of simulation between programs. In Second Int. Joint Conf. on Artificial Intelligence, BCS, pages 481–489, 1971.
R. Milner. A calculus of communication systems. In LNCS 92, Springer Verlag, 1980.
R. Milner. A complete axiomatization for observational congruence of finite-state behaviours. Information and Computation, 81:227–247, 1989.
Z. Manna and A. Pnueli. Adequate proof principles for invariance and liveness properties of concurrent programs. Science of Computer Programming, 32, 1984.
Z. Manna and A. Pnueli. The anchored version of the temporal framework. In J.W. De Bakker, W.P. De Roover, and G. Rozenberg, editors, Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer Verlag, 1989.
E.D. Muller. Infinite sequences and finite machines. In 4th IEEE Ann. Symp. on Switching Circuit and Logical Design, pages 3–16, 1963.
D. Niwinski. Fixed points vs. infinite generation. In Proc. of Third. Symp. on Logic in Computer Science, Computer Society Press, 1988.
D. Park. Concurrency and automata on infinite sequences. In 5th GI-Conference on Theorical Computer Science, Springer Verlag, 1981. LNCS 104.
G. D. Plotkin. A structural approach to operational semantics. Lecture Notes, Aarhus University, 1981.
M.O. Rabin. Decidability of second order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141, 1969.
M.O. Rabin. Weakly definable relations and special automata. In Y. Bar Hillel, editor, Proc. Symp. Math. Logic and Foundations of Set Theory, North-Holland, 1970.
M.O. Rabin. Automata on infinite objects and church's problem. In Proc. Regional AMS Conf. Series in Mathematics, 1972.
A. Saoudi. Variétés d'automates descendants d'arbres infinis. TCS, 43, 1986.
A. P. Sistla. On characterization of safety and liveness. In Proc. 4th Symp. Princ. of Dist. Comp., pages 39–48, ACM, 1985.
R.S. Streett. Propositional dynamic logic of looping and converse. Information and Control, 54, 1982.
R.J. van Glabbeek. The Linear Time — Branching Time Spectrum. Technical Report CS-R9029, Centre for Mathematics and Computer Science, 1990.
R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). CS-R 8911, Centrum voor Wiskunde en Informatica, Amsterdam, 1989.
M.Y. Vardi and P. Wolper. Automata-theoritic techniques for modal logics of programs. J. Comp. Sys. Sci., 32, 1986.
G. Winskel. Synchronization trees. In J. Diaz, editor, 10th ICALP, LNCS 154, 1983.
P. Wolper. On the relation of programs and computations to models of temporal logic. In Temporal Logic in Specification, LNCS 398, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouajjani, A., Fernandez, J.C., Graf, S., Rodriguez, C., Sifakis, J. (1991). Safety for branching time semantics. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_126
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive