Boundedness of reset P/T nets

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

Volumn 1644 LNCS, Issue , 1999, Pages 301-310

  Dufourd, C ^a   Jancar P ^b   Schnoebelen, Ph ^a  

^a CNRS   (France)

^b VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOUNDEDNESS; COUNTER MACHINES; P/T NET; RESET ARCS; RESET NETS; TRANSFER ARCS;

AUTOMATA THEORY;

EID: 84887436670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_27     Document Type: Conference Paper

References (10)

1. [Cia94] G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications & Theory of Petri Nets, Zaragoza, Spain, June 1994, vol. 815 of LNCS, pp 179-198. Springer, 1994.
2. [DFS98] C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP'98), Aalborg, Denmark, July 1998, vol. 1443 of LNCS, pp 103-115. Springer, 1998.
3. [Duf98] C. Dufourd. Reseaux de Petri avec reset transfert: Decidabilite et indecidabilite. These de Docteur en Sciences de l'Ecole Normale Superieure de Cachan, October 1998.
4. [EFM99] J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proc. 14th IEEE Symp. Logic in Computer Science (LICS'99), Trento, Italy, July 1999, 1999.
5. [FS98] A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN'98), Campinas, Brazil, Apr. 1998, vol. 1380 of LNCS, pp 102-118. Springer, 1998.
6. [HP79] J. Hopcroft and J.-J. Pansiot. On the reachability problem for 5- dimensional vector addition systems. Theor. Comp. Sci., 8(2):135-159, 1979.
7. [KCK+97] 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 & Theory of Petri Nets, Toulouse, France, June 1997, vol. 1248 of LNCS, pp 328-347. Springer, 1997.
8. [LC94] C. Lakos and S. Christensen. A general approach to arc extensions for coloured Petri nets. In Proc. 15th Int. Conf. Applications & Theory of Petri Nets, Zaragoza, Spain, June 1994, vol. 815 of LNCS, pp 338-357. Springer, 1994.
9. [May98] R. Mayr. Lossy counter machines. Tech. Report TUM-I9830, Institut fur Informatik, TUM, Munich, Germany, October 1998.
10. 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, vol. 62 of LNCS, pp 464-476. Springer, 1978.