Abstract
It is well known that Petri nets are a very suitable model for the description and analysis of concurrent systems, and several timed extensions of PNs have been defined to specify the behaviour of systems including time restrictions. But some software designers still find it a little difficult to work directly with Petri nets, specially when dealing with large systems, and they prefer to work with a formalism closer to a programming language, such as algebraic specification languages. Our goal, then, in this paper is to present an automatic translation of specifications written in a (timed) algebraic language (TPAL) into a timed model of Petri nets (Timed-Arc Petri nets). In this task we try to exploit as far as possible the special characteristics of Timed-Arc Petri nets, more specifically the presence of dead tokens, which allows us to extend in some particular cases the classical translations.
This work has been supported by the CICYT project ”Performance Evaluation of Distributed Systems”, TIC2000-0701-C02-02.
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
W. M. P. van der Aalst. Interval Timed Coloured Petri Nets and their Analysis. Lecture Notes in Computer Science, vol. 691, pp. 451–472. 1993.
W. M. P. van der Aalst and M. A. Odijk. Analysis of Railway Stations by Means of Interval Timed Coloured Petri Nets. Real-Time Systems, vol. 9, pp. 241–263. 1995.
Parosh A. Abdulla and Aletta Nylén. Timed Petri Nets and BQOs. Proc. 22nd International Conference on Theory and Application of Petri Nets. Lecture Notes in Computer Science, vol. 2075, pp. 53–70. 2001.
M. Ajmone Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte and A. Cumani. On Petri Nets with Stochastic Timing. Proc. of the International Workshop on Timed Petri Nets, IEEE Computer Society Press, pp. 80–87. 1985.
E. Best, R. Devillers, J. Hall. The Petri Box Calculus: A New Causal Algebra with Multi-label Communication. Advances in Petri Nets, 1992. Lecture Notes in Computer Science, vol. 609, pp. 21–69. 1992.
T. Bolognesi, F. Lucidi and S. Trigila. From Timed Petri Nets to Timed LOTOS. Proceedings of the Tenth International IFIP WG6.1 Symposium on Protocol Specification, Testing and Verification. North-Holland, 1990.
Fred D. J. Bowden. Modelling time in Petri nets. Proc. Second Australia-Japan Workshop on Stochastic Models. 1996.
Antonio Cerone and Andrea Maggiolo-Schettini. Time-based expressivity of time Petri nets for system specification. Theoretical Computer Science (216)1–2, pp. 1–53. 1999.
D. de Frutos, V. Valero and O. Marroquín. Decidability of Properties of Timed-Arc Petri Nets. Proc. ICATPN 2000, Lecture Notes in Computer Science, vol. 1825, pp. 187–206. 2000.
U. Goltz. On representing CCS programs by finite Petri nets. MFCS, Lecture Notes in Computer Science, vol. 324 (1988), 339–350.
Hans-Michael Hanisch. Analysis of Place/Transition Nets with Timed-Arcs and its Application to Batch Process Control. Application and Theory of Petri Nets, LNCS vol. 691, pp:282–299. 1993.
P. Merlin. A Study of the Recoverability of Communication Protocols. PhD. Thesis, Univ. of California. 1974.
F. Moller and C. Tofts. A Temporal Calculus of Communicating Systems. CONCUR’90. Lecture Notes in Computer Science, vol. 458, pp. 401–415. 1990.
J. Pardo, V. Valero, F. Cuartero and D. Cazorla. Automatic Translation of TPAL specifications into Dynamic State Graphs. To appear in the proc. of APSEC’01, IEEE Computer Society Press. 2001.
C. Ramchandani. Performance Evaluation of Asynchronous Concurrent Systems by Timed Petri Nets. PhD. Thesis, Massachusetts Institute of Technology, Cambridge. 1973.
G. M. Reed and A. W. Roscoe. Metric Spaces as Models for Real-Time Concurrency. Mathematical Foundations of Programming. Lecture Notes in Computer Science, vol. 298, pp. 331–343. 1987.
J. Sifakis. Use of Petri Nets for Performance Evaluation. Proc. of the Third International Symposium IFIP W. G.7.3., Measuring, Modelling and Evaluating Computer Systems. Elsevier Science Publishers, pp. 75–93. 1977.
Dirk Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Lecture Notes in Computer Science, vol. 369. 1989.
V. Valero, D. de Frutos and F. Cuartero. On Non-decidability of Reachability for Timed-Arc Petri Nets. Proc. 8th Int. Workshop on Petri Nets and Performance Models, PNPM’99, pp. 188–196. 1999.
V. Valero, D. de Frutos, and F. Cuartero. Decidability of the Strict Reachability Problem for TPN’s with Rational and Real Durations. Proc. 5th. International Workshop on Petri Nets and Performance Models, pp. 56–65. 1993.
B. Walter. Timed Petri-Nets for Modelling and Analysing Protocols with Real-Time Characteristics. Proc. 3rd IFIP Workshop on Protocol Specification, Testing and Verification, North-Holland. 1983.
Wang Yi. A Calculus of Real Time Systems. PhD. Thesis, Chalmers University of Technology. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valero, V., Pardo, J.J., Cuartero, F. (2002). Translating TPAL Specifications into Timed-Arc Petri Nets. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_24
Download citation
DOI: https://doi.org/10.1007/3-540-48068-4_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43787-1
Online ISBN: 978-3-540-48068-6
eBook Packages: Springer Book Archive