Verification of siphons and traps for algebraic petri nets

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

Volumn 1248, Issue , 1997, Pages 427-446

  Schmidt, Karsten ^a,b  

^a AALTO UNIVERSITY   (Finland)

^b University of Technology   (Germany)

Author keywords

Analysis and synthesis; Higher level net models; Structure and behaviour of nets; Theory

Indexed keywords

PETRI NETS;

ALGEBRAIC PETRI NETS; ANALYSIS AND SYNTHESIS; CONCURRENT SYSTEMS; HIGHER-LEVEL NET MODELS; STRUCTURAL INDUCTION; STRUCTURAL REASONING; SYMBOLIC REPRESENTATION; THEORY;

SIPHONS;

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

References (19)

1. K. Barkaoui, J. M. Couvreur, and C. Dutheillet. On liveness in extended non self-controlling nets. Proc. of the 16th Int. Conf. on Application and Theory of Petri nets, pages 25-44, 1995.
2. K. Barkaoui, C. Dutheillet, and S. Haddad. An efficient algorithm for finding structural deadlocks in colored Petri nets. Proc. of 14th Intern. Conf. on Application and Theory of Petri nets, Chicago, pages 69-88, 1993.
3. K. Barkaoui and M. Minoux. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. Proc. of 13. Int. Conf. on Application and Theory of Petri nets, Sheffield, pages 62-74, 1992
4. J.M. Couvreur and J. Martinez. Linear invariants in commutative high level nets. High-level Petri nets, Theory and Application, 1991.
5. F. Commoner. Deadlocks in Petri nets. Technical report, Applied Data Research Inc. Wakefield, Massachussetts, 1972.
6. J.M. Couvreur. The general computations of flows for coloured nets. Proc. of the 11th int. Workshop on Application and Theory of Petri nets, 1990.
7. J. Espeleta, J.M. Couvreur, and M. Silva, A new technique for finding a generating family of siphons, traps and st-components. application to colored Petri nets. Advances in Petri nets, pages 126-147, 1993.
8. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications, volume 1 of EATCS Monographs on Theoretical Computer Science 6. Springer, Berlin, 1985.
9. K. Lautenbach. Linear algebraic calculation of deadlock and traps. Advances in Petri nets, pages 315-336, 1987.
10. L. C. Paulson. Isabelle. LNCS 828, Springer, 1994, 1986.
11. W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1-34, 1991.
12. R.S. Boyer and J.S. Moore. Overview of a theorem-prover for a computational logic. Proceedings of the 8th Conference on Automated Deduction, Springer, 1986.
13. H.W. Schmidt. Prototyping and analysis of non-sequential systems using predicate-event nets. The Journal of Systems and Software, 15(1):43, - April 1991.
14. K. Schmidt. On the computation of place invariants for algebraic Petri nets. Proceedings of the STRICT workshop Berlin, 1995.
15. K. Schmidt. How to calculate symbolically siphons and traps for some algebraic Petri nets. Technical report, Helsinki University of Technology, Otaniemi, 1996.
16. K. Schmidt. Siphons, traps and high-level nets with infinite color domains. In preparation, 1996.
17. K. Schmidt. Symbolische Analysemethoden fur algebraische Petri-Netze. PhD thesis, Humboldt-Universität zu Berlin, 1996.
18. P. Starke. Analyse von Petri-Netz-Modellen. B.G. Teubner Stuttgart, 1990.
19. D. Wolz. A tool for checking adt completeness and consistency. Proceedings of the 3rd LOTOSPHERE workshop, Pisa, 1992.