A causal semantics for time Petri nets

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 409-447

  Aura, Tuomas ^a   Lilius, Johan ^b  

^a AALTO UNIVERSITY   (Finland)

^b ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Linear constraints; Net theory; Partial order semantics; Processes; Timing analysis

Indexed keywords

EID: 0005865314     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00114-0     Document Type: Article

References (22)

1. T. Aura, J. Lilius, Time processes for time Petri nets, Proc. 18th International Conf. on Applications and Theory of Petri Nets 1997, Lecture Notes in Computer Science, vol. 1248, Springer, Berlin, 1997, pp. 136-155.
2. B. Berthomieu, M. Diaz, Modelling and verification of time dependent systems using time Petri nets, IEEE Trans. Software Eng. 17(3) (1991) 259-273.
3. B. Berthomieu, M. Menasche, A state enumeration approach for analyzing time Petri nets, Proc. 3rd European Workshop on Applications and Theory of Petri Nets, September 1982, pp. 27-56.
4. E. Best, Structure theory of Petri nets: the free choice hiatus, Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science, vol. 254, Springer, Berlin, 1986, pp. 168-205.
5. E. Best, R. Devillers, Sequential and concurrent behavior in Petri net theory, Theoret. Comput. Sci. 55 (1987) 87-136.
6. E. Best, C. Fernández, Nonsequential Processes, A Petri Net View, EATCS Monographs on Computer Science, vol. 13, Springer, Berlin, 1988.
7. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990.
8. M. Diaz, P. Sénac, Time stream Petri nets, a model for timed multimedia information, Proc. 15th Int. Conf. Application and Theory of Petri Nets 1994, Lecture Notes in Computer Science, vol. 815, Springer, Berlin, June 1994, pp. 219-238.
9. J. Engelfriet, Branching processes of Petri nets, Acta Inform. 28 (1991) 575-591.
10. J. Esparza, Model checking using net unfoldings, Sci. Comput. Programming 23 (1994) 151-195.
11. H. Hulgaard, S.M. Burns, Efficient timing analysis of a class of Petri nets, Computer Aided Verification 7th Int. Workshop CAV'95, Lecture Notes in Computer Science, vol. 939, Springer, Berlin, 1995, pp. 423-436.
12. J. Lilius, Efficient state space search for time petri nets, Proc. MFCS Workshop on Concurrency, 1998.
13. K. McAloon, C. Tretkoff, 21p: Linear programming and logical programming, available as http://acc6.its.brooklyn.cuny.edu/lbslab/ppcp93.html.
14. P.M. Merlin, D.J. Farber, Recoverability of communication protocols - implications of a theoretical study, IEEE Trans. Comm. 24(9) (1976) 1036-1043.
15. T. Murata, Petri nets, properties, analysis and applications, Proc. IEEE 77(4) (1989) 541-580.
16. I.J. N1053, Enhancements to LOTOS, 1995.
17. J.L. Peterson, Petri Net Theory and the Modeling of Systems, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981.
18. L. Popova, On time Petri nets, J. Inform. Process. Cybernet. EIK 27(4) (1991) 227-244.
19. C. Ramchandani, Analysis of asynchronous concurrent systems by timed Petri nets, Technical Report, Project MAC, TR 120, MIT, February 1974.
20. W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, vol. 4, Springer, Berlin, 1985.
21. V. Valero, D. de Frutos, F. Cuartero, Timed processes of timed Petri nets, Proc. 16th Int. Conf. on Application and Theory of Petri Nets 1995, Lecture Notes in Computer Science, vol. 935, Springer, Berlin, June 1995.
22. J. Winkowski, Algebras of processes of timed Petri nets, CONCUR'94: Concurrency Theory, Lecture Notes in Computer Science, vol. 836, Springer, Berlin, August 1994, pp. 195-209.