Abstract
Spin is a software package for the verification of concurrent systems. A system to be verified is modeled in Promela — Spin’s input language. We present an extension of Promela and Spin with discrete time that provides an opportunity to model systems whose correct functioning crucially depends on timing parameters. This extension is completely compatible with all the features of the standard package, in particular the partial order reduction algorithm. We have tested the prototype tool on several applications known from the verification literature and the first results are promising.
On leave from the Institute of Informatics, Faculty of Natural Sciences and Mathematics, University “Sts. Cyril and Methodius”, Skopje, Macedonia. Supported by EC ESPRIT LTR Project No. 23498 (VIRES).
Supported by the Netherlands Computer Science Research Foundation (SION).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Dill, D.L., A Theory of Timed Automata, Theoretical Computer Science, 126, pp. 183–235, 1994.
Alur, R., Kurshan, R.P., Timing Analysis in Cospan, Hybrid Systems III, LNCS 1066, pp.220–231, Springer, 1996.
Bošnački, D., Towards Modelling of Hybrid Systems in Promela and Spin, Third International Workshop on Formal Methods in Industrial Critical Systems FMICS’98, 1998
Dams, D., Gerth, R., Bounded Retransmission Protocol Revisited, Second International Workshop on Verification of Infinite Systems, Infinity’97, 1997
D’Argenio, P. R., Katoen, J.-P., Ruys, T., Tretmans, J., The Bounded Retransmission Protocol Must Be on Time!, TACAS’97, 1997
Dill, D., Timing Assumptions and Verification of Finite-State Concurrent Systems, CAV’89, LNCS 407, Springer, 1989
Groote, J. F., van de Pol, J., A Bounded Retransmission Protocol for Large Data Packets, in Wirsing, M., Nivat, M., ed., Algebraic Methodology and Software Technology, LCNS 1101, pp. 536–550, Springer-Verlag, 1996
Henzinger, T. A., Kopke, P. W., Discrete-Time Control for Rectangular Automata, Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP 1997), LNCS 1256, pp. 582–593, Springer-Verlag, 1997
Henzinger, T. A., Manna, Z., Pnueli, A., What good are digital clocks?, Proceedings of the ICALP’92, LNCS 623, pp.545–558, Springer-Verlag, 1992.
Holzmann, G. J., Design and Validation of Communication Protocols, Prentice Hall, 1991. Also: http://netlib.bell-labs.com/netlib/spin/whatispin.html
Kars, P., Formal Methods in the Design of Storm Surge Barrier Control System, Hand-outs of School on Embedded Systems, Veldhoven, The Netherlands, 1996
Klusener, A. S., Models and Axioms for a Fragment of Real Time Process Algebra, Ph. D. Thesis, Eindhoven University of Technology, 1993
Larsen, K. G., Pettersson, P., Yi, W., UPPAAL: Status & Developments, Computer Aided Verification CAV 97, LNCS 1254, pp.456–459, Springer-Verlag, 1992.
Tanenbaum, A., Computer Networks, Prentice Hall, 1989
Tripakis, S., Courcoubetis, C., Extending Promela and Spin for Real Time, TACAS ’96, LCNS 1055, Springer Verlag, 1996
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bošnački, D., Dams, D. (1998). Discrete-time Promela and Spin. 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/BFb0055359
Download citation
DOI: https://doi.org/10.1007/BFb0055359
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