Abstract
Modal logics are an important tool in the analysis, specification and verification of reactive systems [12]. Among many other applications, logics like HML have been used as a benchmark for semantic equivalences [9], as the specification language used in model checking tools [1], and as a language in which to explain why two systems are not semantically equivalent [11].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(l):36–72, January 1993.
R. De Nicola and G. L. Ferrari. Observational logics and concurrency models. In Proc. 10th Conf. Found, of Software Technology and Theor. Comp. Sci. Bangalore, India, LNCS 472, pages 301–315. Springer-Verlag, December 1990.
R. De Nicola, U. Montanari, and F. Vaandrager. Back and forth bisimulations. In Proc. CONCUR’90, Amsterdam, LNCS 458, pages 152–165. Springer-Verlag, August 1990.
R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Research Report CS-R9012, CWI, 1990.
R. De Nicola and F. Vaandrager. Three logics for branching bisimulation (extended abstract). In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, PA, pages 118–129, June 1990.
R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Research Report SI-92/07, Dipartimento di Scienze dell’Informazione, Università degli Studi di Roma La Sapienza, November 1992.
D. Gabbay. The declarative past and imperative future: Executable temporal logic for interactive systems. In Proc. Temporal Logic in Specification, Altrincham, UK, LNCS 398, pages 409–448. Springer-Verlag, April 1987.
D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. Principles of Programming Languages, Las Vegas, Nevada, pages 163–173, January 1980.
M. Hennessy and R. Milner. Algebraic laws for nondeterminismand concurrency. Journal of the ACM, 32(1):137–161, January 1985.
M. Hennessy and C. Stirling. The power of the future perfect in program logics. Information and Control, 67:23–52, 1985.
M. Hillerström. Verification of CCS processes. M.Sc. Thesis, Aalborg University, 1987.
C. Stirling. Modal and temporal logics. Research Report ECS-LFCS-91-157, Lab. for Foundations of Computer Science, Edinburgh, May 1991. To appear in, S. Abramsky, D. Gabbay and T. S. E. Maibaum (eds), “Handbook of Logic in Computer Science”, Oxford University Press.
F. Vaandrager. Translating back and forth logic to HML with until operator. Unpublished note, 1992.
M. Vardi. A temporal fixpoint calculus. In Proc. 15th ACM Symp. Principles of Programming Languages, San Diego, CA, pages 250–259, January 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 British Computer Society
About this paper
Cite this paper
Laroussinie, F., Pinchinat, S., Schnoebelen, P. (1994). Translation Results for Modal Logics of Reactive Systems. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds) Algebraic Methodology and Software Technology (AMAST’93). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3227-1_31
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3227-1_31
Publisher Name: Springer, London
Print ISBN: 978-3-540-19852-9
Online ISBN: 978-1-4471-3227-1
eBook Packages: Springer Book Archive