Abstract
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (Fsts) model we introduce in this paper extends the basic αSts model [KP96] by introducing operations for parallel composition, for the restriction of variables, and by addressing fairness. We introduce a weak fairness (justice) condition which ensures that any communication deadlock in a system can only occur through the need for external synchronization. We present an extended version of linear time temporal logic (Eltl) for expressing and proving safety and liveness properties of synchronous specifications, and provide a sound and compositional proof system for it.
This research was supported in part by the Minerva Foundation, by an infrastructure grant from the Israeli Ministry of Science, by US National Science Foundation grants CCR-9509931 and CCR-9712383, and by US Air Force Office of Scientific Research Contract No. F49620-95-C0044. Part of this research was done as part of the European Community project SACRES (EP 20897). The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of NSF, AFOSR, the European Union, or the U.S. Government. We are grateful to Sam Owre for lending assistance with PVS.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and L. Lamport. Conjoining Specifications. TOPLAS, 17(3), pages 507–534, 1995.
A. Benveniste, P. Le Guernic, and P. Aubry. Compositionality in dataflow synchronous languages: specification & code generation. Proceedings of COMPOS’97.
A. Benveniste, P. Le Guernic, and C. Jacquemot. Synchronous programming with event and relations: the SIGNAL language and its semantics. Science of Computer Programming, 16, pages 103–149, 1991.
G. Berry and G. Gonthier. The ESTEREL Synchronous Programming Language: Design, semantics, implementation. Science of Computer Programming, 19(2), 1992.
P. Caspi, N. Halbwachs, D. Pilaud, and J. Plaice. LUSTRE, a Declarative Language for Programming Synchronous Systems. POPL’87, ACM Press, pages 178–188, 1987.
N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer, Dordrecht, The Netherlands, 1993.
D. Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming, 8, pages 231–274, 1987.
Y. Kesten and A. Pnueli. An αSts-based common semantics for Signal and Statecharts, March 1996. Sacres Manuscript.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS. IEEE trans. on software eng., 21(2), pages 107–125, 1995.
A. Pnueli, M. Siegel, and E. Singerman. Translation Validation. TACAS’98, LNCS 1384, pages 151–166, 1998.
A. Pnueli, N. Shankar, and E. Singerman. Fair Synchronous Transition Systems and their Liveness Proofs. Technical Report SRI-CSL-98-02, http://www.csl.sri.com/csl-98-2.html, 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pnueli, A., Shankar, N., Singerman, E. (1998). Fair synchronous transition systems and their liveness proofs. In: Ravn, A.P., Rischel, H. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998. Lecture Notes in Computer Science, vol 1486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055348
Download citation
DOI: https://doi.org/10.1007/BFb0055348
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65003-4
Online ISBN: 978-3-540-49792-9
eBook Packages: Springer Book Archive