Abstract
Processes of Petri nets are usually represented by occurrence nets. In this paper we extend this notion to Timed Petri Nets maintaining the structure of timed processes as occurrence nets, but adding time information to the tokens. In order to do that we need first to define formally the model of Timed Petri Nets that we consider, and then we relate timed step sequences with timed processes, obtaining similar results to those for the classical theory of ordinary (non-timed) processes.
Partially supported by CICYT projects TIC-94-0851-c02-02, PB-092-511.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Best E., Devillers R.: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science, 55(87–136), 1987.
H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of general net theory. Net Theory and Applications, LNCS 84 (21–163), 1980.
U. Goltz, W. Reisig.: The non-sequential behaviour of Petri nets. Inform. and control no. 57 (125–147), 1983.
P. Merlin.: A Study of the Recoverability of Communication Protocols. Thesis Doc. Computer Science Dep. Univ. California, 1974.
J.L. Peterson: Petri Net Theory and the Modeling of Systems. Prentice-Hall, 1991.
C. Ramchandani.: Analysis of Asynchronous Concurrent Systems by Timed Petri Nets. Project MAC, TR 120, MIT, 1974.
Peter H. Starke. Some Properties of Timed Nets Under the Earliest Firing Rule. Advances of Petri Nets, 1989, LNCS 424.
V. Valero, D. de Frutos, F. Cuartero.: Simulation of Timed Petri Nets by Ordinary Petri Nets and Applications to Decidability of the Timed Reachability Problem and other related problems. Proc. Fourth Intern. Workshop of Petri Nets and Performance Models, pp. 154–163, Melbourne, 1991.
V. Valero, D. de Frutos, F. Cuartero.: Decidability of the Strict Reachability Problem for TPN's with Rational and Real Durations. Proc. Fifth Intern. Workshop of Petri Nets and Performance Models, pp. 56–65, Toulouse, 1993.
W. Vogler.: Deciding History Preserving Bisimilarity. Lect. Notes in Computer Science, 510, Proc. ICALP 1991.
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.
J. Winkowski.: Algebras of Processes of Timed Petri Nets. Proc. of CONCUR'94. 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valero, V., Frutos, D.d., Cuartero, F. (1995). Timed processes of Timed Petri Nets. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_56
Download citation
DOI: https://doi.org/10.1007/3-540-60029-9_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60029-9
Online ISBN: 978-3-540-49408-9
eBook Packages: Springer Book Archive