Analysis of petri nets with a dynamic priority method

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

Volumn 1248, Issue , 1997, Pages 215-234

  Bause, Falko ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DYNAMIC PRIORITY; LIVENESS; T-INVARIANT;

PETRI NETS;

EID: 84958983443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63139-9_38     Document Type: Conference Paper

References (21)

1. P. Bause. On the Analysis of Petri Nets with Static Priorities. Acta Informatica, 33:669-685, 1996.
2. F. Bause, P. Kritzinger. Stochastic Petri Nets - An Introduction to the Theory. Vieweg, Advanced Studies in Computer Science, 1996.
3. E. Best and M. Koutny. Petri net semantics of priority systems. Theoretical Computer Science, 96:175-215, 1992.
4. E. Best and K. Voss. Free choice systems have home states. Acta Informatica, 21:89-100, 1984.
5. S. Caselli, G. Conte and P. Marenzoni. Parallel state space exploration for GSPN models. In Application and Theory of Petri Nets, LNCS 935, pages 181-201, Springer-Verlag, 1995.
6. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.
7. F. Feldbrugge. Petri Net Tool Overview 1992. In Advances in Petri Nets, Springer-Verlag, pages 169-209, 1993.
8. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems. Ph.D. thesis, Univerite de Liege, 1995.
9. R. Janicki, A formal semantics for concurrent systems with a priority relation. Acta Informatica, 24:33-55, 1987.
10. P. Kemper. Reachability analysis based on structured representations. 17th Int. Conf. Application and Theory of Petri nets, 1996.
11. M. Koutny. Modelling systems with dynamic priorities. Advances in Petri Nets, pages 251-266, Springer-Verlag, 1992.
12. J.L. Peterson. Petri Net Theory and the Modelling of Systems. Prentice-Hall, 1981.
13. K. Varpaaniemi, J. Halme, K. Hiekkanen and T. Pyssysalo. PROD reference manual. Technical Reports Series B, No 13, Helsinki University of Technology, Digital Systems Laboratory, 1995.
14. M. Rauhamaa. A comparative study of methods for efficient reachability analysis. Helsinki Univerity of Technology, Digital Systems Lab., Report A14, Sept. 1990.
15. E. Teruel, P. Chrzastowski-Wachtel, J.M. Colom and M. Silva. On Weighted T-Systems. In Proceedings of the 13th International Conference on Application and Theory of Petri Nets, Sheffield (UK), 1992.
16. E. Teruel and M. Silva. Liveness and home states in equal conflict systems. In Proceedings of the 14th International Conference on Application and Theory of Petri Nets, Chicago (USA), pages 415-432, 1993.
17. M. Tiusanen. Symbolic, Symmetry, and Stubborn Set Searches In Proceedings of the 15th European Workshop on Application and Theory of Petri Nets, Zaragoza (Spain), pages 511-530, 1994.
18. A. Valmari. Error Detection by Reduced Reachability Graph Generation. In Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, Venice (Italy), pages 95-112, 1988.
19. A. Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets, Springer-Verlag, 1990.
20. A. Valmari. State of the Art Report: Stubborn Sets. Petri Net Newletters 46, pages 6-14, 1994.
21. K. Varpaaniemi. On Combining the Stubborn Set Method with the Sleep Set Method. In Proceedings of the 15th European Workshop on Application and Theory of Petri Nets, Zaragoza (Spain), pages 548-567, 1994.