Reset nets between decidability and undecidability

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

Volumn 1443 LNCS, Issue , 1998, Pages 103-115

  Dufourd, C ^a   Finkel, A ^a   Schnoebelen, Ph ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; COVERABILITY; PETRI NET MODELS; REACHABILITY; RESET ARCS; RESET NETS; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY; PETRI NETS;

AUTOMATA THEORY;

EID: 84878552622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. P. A. Abdulla, K. Čer̄ans, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Symp. Logic in Computer Science (LIGS'96), New Brunswick, NJ, USA, July 1996, pages 313-321, 1996.
2. T. Araki and T. Kasami. Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science, 3(1):85-104, 1977.
3. J. Billington. Extensions to coloured Petri nets and their applications to protocols. PhD thesis, University of Cambridge, UK, May 1991. Available as Tech. Report No.222.
4. G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179-198. Springer-Verlag, 1994.
5. A. Finkei. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144-179, 1990.
6. A. Finkel and Ph. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN'98), Campinas, Brazil, Apr. 1998, volume 1380 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
7. M. Hack. Decidability questions for Petri nets. PhD Thesis MIT/LCS/TR-161, Massachusetts Institute of Technology, Lab. for Computer Science, June 1976.
8. M. Kishinevsky, J. Cortadella, A. Kondratyev, L. Lavagno, A. Taubin, and A. Yakovlev. Coupling asynchrony and interrupts: Place chart nets. In Proc. 18th Int. Conf. Application and Theory of Petri Nets, Toulouse, France, June 1997, volume 1248 of Lecture Notes in Computer Science, pages 328-347. Springer-Verlag, 1997.
9. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147-195, 1969.
10. C. Lakos and S. Christensen. A general approach to arc extensions for coloured Petri nets. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 338-357. Springer-Verlag, 1994.
11. J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall Int., 1981.
12. C. Rackoff. The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6(2):223-231, 1978.
13. K. Reinhardt. Reachability in Petri nets with inhibitor arcs, November 1995. Unpublished manuscript. See www-fs.informatik.uni-tuebingen.de/~reinhard.
14. R. Valk. On the computational power of extended Petri nets. In Proc. 1th Symp. Math. Found. Comp. Sci. (MFCS'78), Zakopane, Poland, Sep. 1978, volume 64 of Lecture Notes in Computer Science, pages 526-535, 1978.
15. R. Valk. Self-modifying nets, a natural extension of Petri nets. In Proc. 5th Int. Coll. Automata, Languages, and Programming (ICALP'78), Udine, Italy, Jul. 1978, volume 62 of Lecture Notes in Computer Science, pages 464-476. Springer-Verlag, 1978.
16. W. Vogler. Partial order semantics and read arcs. In Proc. 22nd Int. Symp. Math. Found. Comp. Sci. (MFCS'97), Bratislava, Slovakia, Aug. 1997, volume 1295 of Lecture Notes in Computer Science, pages 508-517. Springer-Verlag, 1997.