Flat Petri Nets (Invited Talk)

[1]  Frédéric Herbreteau,et al.  Acceleration of Affine Hybrid Transformations , 2014, ATVA.

[2]  Pierre Wolper,et al.  Symbolic Verification with Periodic Sets , 1994, CAV.

[3]  Kenneth McAloon,et al.  Petri Nets and Large Finite Sets , 1984, Theor. Comput. Sci..

[4]  Albert R. Meyer,et al.  The Complexity of the Finite Containment Problem for Petri Nets , 1981, JACM.

[5]  Frédéric Herbreteau,et al.  The Power of Hybrid Acceleration , 2006, CAV.

[6]  Ahmed Bouajjani,et al.  Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract) , 1997, ICALP.

[7]  Philippe Schnoebelen,et al.  Flat Acceleration in Symbolic Model Checking , 2005, ATVA.

[8]  Grégoire Sutre,et al.  On Flatness for 2-Dimensional Vector Addition Systems with States , 2004, CONCUR.

[9]  Pierre Wolper,et al.  The Power of QDDs (Extended Abstract) , 1997, SAS.

[10]  Laure Petrucci,et al.  FAST: Fast Acceleration of Symbolikc Transition Systems , 2003, CAV.

[11]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[12]  Marius Bozga,et al.  On Flat Programs with Lists , 2007, VMCAI.

[13]  Jérôme Leroux,et al.  FAST Extended Release , 2006, CAV.

[14]  Alain Finkel,et al.  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols , 2002, FSTTCS.

[15]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

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

[17]  Laurent Fribourg,et al.  Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic , 1997, CONCUR.

[18]  Ahmed Bouajjani,et al.  Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems , 2000, CAV.

[19]  Jean-Luc Lambert,et al.  A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

[20]  Alain Finkel,et al.  FASTer Acceleration of Counter Automata in Practice , 2004, TACAS.

[21]  Yassine Lakhnech,et al.  Flat Parametric Counter Automata , 2006, ICALP.

[22]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..