Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fir ...

[1]  R. Alur.  Techniques for automatic verification of real-time systems , 1991 .

[2]  Ahmed Bouajjani,et al.  Model Checking Lossy Vector Addition Systems , 1999, STACS.

[3]  Parosh Aziz Abdulla,et al.  Verifying Networks of Timed Processes (Extended Abstract) , 1998, TACAS.

[4]  David de Frutos-Escrig,et al.  Decidability of Properties of Timed-Arc Petri Nets , 2000, ICATPN.

[5]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[6]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[7]  Parosh Aziz Abdulla,et al.  Model checking of systems with many identical timed processes , 2003, Theor. Comput. Sci..

[8]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[9]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[10]  C. Petri.  Kommunikation mit Automaten , 1962 .

[11]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[12]  Philippe Schnoebelen,et al.  Fundamental Structures in Well-Structured Infinite Transition Systems , 1998, LATIN.

[13]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[14]  Parosh Aziz Abdulla,et al.  Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets , 2004, FSTTCS.

[15]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[16]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[17]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

[18]  Aziz Abdulla and Aletta Nylén Parosh.  Undecidability of LTL for Timed Petri Nets , 2003 .

[19]  Serge Haddad,et al.  Comparison of Different Semantics for Time Petri Nets , 2005, ATVA.

[20]  Richard Mayr,et al.  Undecidable problems in unreliable computations , 2000, Theor. Comput. Sci..

[21]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.

[22]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[23]  Parosh Aziz Abdulla,et al.  Multi-clock timed networks , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[24]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[25]  Philippe Schnoebelen,et al.  Boundedness of Reset P/T Nets , 1999, ICALP.

[26]  Pritha Mahata.  Model Checking Parameterized Timed Systems , 2005 .

[27]  Parosh Aziz Abdulla,et al.  Forward Reachability Analysis of Timed Petri Nets , 2004, FORMATS/FTRTFT.

[28]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[29]  Bernd Heinemann.  Subclasses of Self-Modifying Nets , 1981, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.