Abstract
We define formally the notion of implementation for time critical systems in terms of provability of properties described abstractly at the specification level. We characterize this notion in terms of formulas of the temporal logic TRIO and operational models of timed Petri nets. Refinement steps are often used as a means to derive in a systematic way the system design starting from its abstract specification. We present a method to formally prove the correctness of refinement rules for timed Petri nets and apply it to a few simple cases. We show how the possibility to retain properties of the specification in its implementation can be exploited to greatly simplify the verification of the designed systems by performing incremental analysis at various levels of the specification/implementation hierarchy.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt, “Ten years of Hoare's Logic: A survey — Part I,” ACM-Transactions on Programming Languages and Systems, vol. 3, no. 4, pp. 431–483, Oct 1981.
R. Alur and T.A. Henzinger, “Real Time Logics: Complexity and Expressivness”, Tech. Report no. STANCS901307, Appeared in the 5th IEEE LICS'90 (pp. 390–401), 1990.
Jacob Itzhack Aizikowitz, “Designing Distributed Services Using Refinement Mappings”, Ph.D. Thesis and Tech. Report 89-1040, Cornell University, Ithaca, New York, 1990.
M.Abadi and L. Lamport, “The existenece of refinement mappings”, Theoretical Computer Science 82 (1991) 253–284, Elsevier Science Publiscers B.V.
W. Damm, G. Dohmen, V. Gerstner, and B. Josko, “Modular verification of Petri nets, the temporal logic approach,” in Proceedings of Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctnesss, LNCS 430, Springer Verlag, 1990, pp.181–207.
H.B. Enderton, A Mathematical Introduction to Logic. New York: Academic Press, 1972.
M. Felder, C. Ghezzi, and M. Pezzè, “Analyzing refinements of state based specifications: the case of TB nets,” in Proceedings of ISSTA'93, Cambridge, 1993, pp. 28–39.
M. Felder, D. Mandrioli, and A. Morzenti, “Proving properties of real-time systems through logical specifications and Petri nets models,” Tech. Rep., TR 91-072, Diparimento di Elettronica e Informazione, Politecnico di Milano, December 1991.
M. Felder, D. Mandrioli, and A. Morzenti, “Proving properties of real-time systems through logical specifications and Petri nets models,” IEEE Transactions on Software Engineering. vol. 20, no. 2, pp. 127–141, February 1994.
M. Felder and A. Morzenti, “Validating real-time systems by executing logic specifications in TRIO,” in Proceedings of 14th International Conference on Software Engineering, ACM/IEEE, 1992, pp. 199–211.
R. Glabbeek and U. Goltz, “Refinement of actions in causality based models”, in Proceedings of Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctnesss, LNCS 430, Springer Verlag, 1990, pp. 266–300.
C. Ghezzi, M. Jazayeri, and D. Mandrioli, Fundamentals of Software Engineering. Englewood Cliffs, N.J.: Prentice-Hall International Editors, 1991.
C. Ghezzi, D. Mandrioli, and A. Morzenti, “TRIO, a logic language for executable specifications of real-time systems,” Journal of Systems and Software, vol. 12, no. 2, pp. 107–123, May 1990.
T. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for real-time systems,” in Proc.of the 18th Annual Symposium on Principles of Programming Languages, ACM-PRESS, 1991, pp. 353–366.
N.A. Lynch and H. Attiya,“Using mapping to prove timing properties” Tech. Report MIT/LCS/TM-412,b Laboratory for Computer Science, MIT, 1989. Appeared in Proc. PODC'90
E. Mendelson, “Introduction to mathematical logic”, Van Nostrand Reinold Company, New York, 1963.
P.M. Merlin and D.J. Farber, “Recoverability of communication protocols — Implications of a theoretical study,” IEEE Transactions on Communications, vol 24, no. 9, pp.1036–1043, September 1976
K. Müller, “Constructable Petri nets”, in Proc. EIK 21. 1985, pp. 171–199.
J. Ostroff, Temporal Logic For Real-Time Systems, Advanced Software Development Series, 1. Taunton, Somerset, England: Research Studies Press LTD., 1989.
A. Pnueli, “Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends,” LNCS 224, Springer-Verlag, 1986.
W. Reisig, Petri Nets: an Introduction., EATCS Monographs on Theoretical Computer Science, Springer Verlag, Berlin-New York, 1985.
I. Suzuki and T. Murata, “A method of stepwise refinement and abstraction of Petri nets”, Journal of Computer System Sciences, no. 18, 1979, pp. 35–46.
Walter Vogler, “Behaviour preserving refinements in Petri nets”, in Proc. 12th Int. Worksop on Graph Theoretic Concepts in Computer Sciende, München, 1986. Springer Verlag, LNCS 246, pp. 82–93.
Walter Vogler, “Failures Semantics based on Interval Semiwords is a Congruence for Refinement”, in Proc. STACS'90, 1990. Springer Verlag, LNCS 415, pp. 285–297.
W.J. Yeh and M. Young, “Compostional Reachability analysis using process algebra”, in 4th Int. Workshop on Testing and Verifications, Victoria, Canada, 1991, ACM Sigsoft, pp. 49–50
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felder, M., Morzenti, A. (1994). A temporal logic approach to implementation and refinement in timed Petri nets. In: Gabbay, D.M., Ohlbach, H.J. (eds) Temporal Logic. ICTL 1994. Lecture Notes in Computer Science, vol 827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013999
Download citation
DOI: https://doi.org/10.1007/BFb0013999
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58241-0
Online ISBN: 978-3-540-48585-8
eBook Packages: Springer Book Archive