Time processes for time Petri nets
The objective of this work is to give Merlin's time Petri nets a partial order semantics based on the nonsequential process semantics for untimed net systems.
A time process of a time Petri net is defined as a traditionally constructed causal process whose events are labeled with occurrence times. In a valid timing, the occurrence times satisfy specific criteria that arise from the interaction between timing constraints and the causal ordering of events. The definitions lead to an efficient algorithm for checking the validness of timings.
The relationship between the firing schedules of a time Petri net and the interleavings of time processes that preserve both causal and temporal order is shown to be bijective. Also, a sufficient condition is given for inferring invalidity of timings from initial subprocesses.
Alternatively, the valid timings can be presented as sets of alternative linear constrains. From them, the existence of a valid timing can be decided.
Keywordstime Petri nets processes timing analysis partial order semantics causality net theory
Unable to display preview. Download preview PDF.
- 1.Tuomas Aura. Time processes of time petri nets. Master's thesis, Department of Computer Science, Helsinki University of Technology, 1996. Also available as Research Report A38, Digital Systems Laboratory, http://saturn.hut.fi/pub/reports/A38.ps.Z.Google Scholar
- 2.Bernard Berthomieu and Michel Diaz. Modelling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, 17(3):259–273, 1991.Google Scholar
- 3.Bernard Berthomieu and Miguel Menasche. A state enumeration approach for analyzing time Petri nets. In Proceedings of the 3rd European Workshop on Applications and Theory of Petri Nets, pages 27–56, September 1982.Google Scholar
- 4.Eike Best and César Fernández. Nonsequential Processes, A Petri Net View, volume 13 of EATCS Monographs on Computer Science. Springer-Verlag, 1988.Google Scholar
- 5.Thomas H. Cormen, Charles E Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT Press, 1990.Google Scholar
- 6.Michel Diaz and Patrick Sénac. Time stream Petri nets, a model for timed multimedia information. In Proceedings of the 15th International Conference on Application and Theory of Petri Nets 1994, volume 815 of LNCS, pages 219–238. Springer-Verlag, June 1994.Google Scholar
- 8.Javier Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151–195, 1994.Google Scholar
- 9.Henrik Hulgaard and Steven M. Burns. Efficient timing analysis of a class of Petri nets. In Computer Aided Verification 7th International Workshop CAV'95, volume 939 of LNCS, pages 423–436. Springer-Verlag, 1995.Google Scholar
- 10.Philip M. Merlin and David J. Farber. Recoverability of communication protocols-implications of a theoretical study. IEEE Transactions on Communications, 24(9):1036–1043, 1976.Google Scholar
- 11.Tadao Murata. Petri nets, properties, analysis and applications. Proceedings of the IEEE, 77(4):541–580, 1989.Google Scholar
- 12.ISO/IEC JTC1/SC21/WG1 N1053. Enhancements to LOTOS, 1995.Google Scholar
- 13.J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., Englewood, NJ, 1981.Google Scholar
- 14.Louchka Popova. On time Petri nets. Journal Inform. Process. Cybern. EIK, 27(4):227–244, 1991.Google Scholar
- 15.C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. Technical report, Project MAC, TR 120, MIT, February 1974.Google Scholar
- 16.Wolfgang Reisig. Petri Nets: An Introduction, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.Google Scholar
- 17.Valentin Valero, David de Frutos, and Fernando Cuartero. Timed processes of timed Petri nets. In Proceedings of the 16th International Conference on Application and Theory of Petri Nets 1995, volume 935 of LNCS. Springer-Verlag, June 1995.Google Scholar
- 18.Józef Winkowski. Algebras of processes of timed Petri nets. In CONCUR'94: Concurrency Theory, volume 836 of LNCS, pages 195–209. Springer-Verlag, August 1994.Google Scholar