Properties of distributed timed-arc petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2245, Issue , 2001, Pages 280-291

  Nielsen, Mogens ^a   Sassone, Vladimiro ^b   Srba, Jiří ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SOFTWARE ENGINEERING;

COVERABILITY; FORMAL DEFINITION; HARDWARE ARCHITECTURE; PROCESS SEMANTICS; REACHABILITY; TIME PARAMETER; TIMED-ARC PETRI NETS;

PETRI NETS;

EID: 84944072613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45294-x_24     Document Type: Conference Paper

References (17)

1. P.A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In Proc. of ICATPN 2001, volume 2075 of LNCS, pages 53–70, 2001.
2. T. Bolognesi and P. Cremonese. The weakness of some timed models for concurrent systems. Technical Report CNUCE C89-29, CNUCE–C.N.R., 1989.
3. T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In Proc. of the IFIP WG 6.1 Tenth International Symposium on Protocol Spec., Testing and Verification, pages 1–14, Amsterdam, 1990.
4. Fred D.J. Bowden. Modelling time in Petri nets. In Proceedingsof the Second Australia-Japan Workshop on Stochastic Models, 1996. http://www.itr.unisa.edu.au/∼fbowden/pprs/stomod96/.
5. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In Proc. of CAV’98, volume 1427 of LNCS, pages 546–550, 1998.
6. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Computation, 57:125–147, 1983.
7. H.M. Hanisch. Analysis of place/transition nets with timed-arcs and its application to batch process control. In Application and Theory of Petri Nets, volume 691 of LNCS, pages 282–299, 1993.
8. S. Hauck. Asynchronous design methodologies: An overview. In Proc. of IEEE, volume 83, pages 69–93, 1995.
9. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Toolsfor Technology Transfer, 1(1–2):134–152, 1997.
10. E.W. Mayr. An algorithm for the general Petri net reachability problem (preliminary version). In Proc. of 13th Ann. ACM Symposium on Theory of Computing, pages 238–246. Assoc. for Computing Machinery, 1981.
11. T. Meincke, A. Hemani, S. Kumar, P. Ellervee, J. Berg, D. Lindqvist, H. Tenhunen, and A. Postula. Evaluating benefits of globally asynchronous locally synchronous VLSI architecture. In Proceedingsof 16th Norchip, pages 50–57, 1998.
12. M. Nielsen, V. Sassone, and J. Srba. Towards a notion of distributed time for Petri nets. In Proc. of ICATPN 2001, volume 2075 of LNCS, pages 23–31, 2001.
13. C. Ramchandani. Performance Evaluation of Asynchronous Concurrent Systems by Timed Petri Nets. Ph.D. Thesis, Massachusetts Inst. of Tech., Cambridge, 1973.
14. V. Valero Ruiz, D. de Frutos Escrig, and O. Marroquin Alosno. Decidability of properties of timed-arc Petri nets. In Proc. of ICATPN 2000, volume 1825 of LNCS, pages 187–206, 2000.
15. V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On non-decidability of reachability for timed-arc Petri nets. In Proc. of PNPM’99, pages 188–196, 1999.
16. J. Sifakis. Use of Petri nets for performance evaluation. In Proc. of the 3rd International Symposium IFIP W.G. 7.3., Measuring, modelling and evaluating computer systems, pages 75–93. Elsevier Science Publ., 1977.
17. J. Wang. Timed Petri Nets, Theory and Application. Kluwer Acad. Publ., 1998.