Zenoness for Timed Pushdown Automata

Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness ...

[1]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[2]  Ashutosh Trivedi,et al.  Recursive Timed Automata , 2010, ATVA.

[3]  Patricia Bouyer,et al.  Model Checking Timed Automata , 2010 .

[4]  Adriano Peron,et al.  Analysis of Timed Recursive State Machines , 2010, 2010 17th International Symposium on Temporal Representation and Reasoning.

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

[6]  Anca Muscholl,et al.  Reachability Analysis of Communicating Pushdown Systems , 2010, FoSSaCS.

[7]  Zhe Dang,et al.  Pushdown timed automata: a binary reachability characterization and safety verification , 2001, Theor. Comput. Sci..

[8]  Igor Walukiewicz,et al.  Efficient emptiness check for timed Büchi automata , 2010, Formal Methods in System Design.

[9]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

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

[11]  Ahmed Bouajjani,et al.  On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures , 1994, Hybrid Systems.

[12]  Javier Esparza,et al.  A BDD-Based Model Checker for Recursive Programs , 2001, CAV.

[13]  Rupak Majumdar,et al.  Decision Problems for the Verification of Real-Time Software , 2006, HSCC.

[14]  Oscar H. Ibarra,et al.  Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.

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

[16]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[17]  Oscar H. Ibarra,et al.  Past pushdown timed automata and safety verification , 2004, Theor. Comput. Sci..

[18]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[19]  Stefan Schwoon,et al.  Model checking pushdown systems , 2002 .

[20]  Kim G. Larsen,et al.  Optimal Strategies in Priced Timed Game Automata , 2004, FSTTCS.

[21]  Stavros Tripakis,et al.  Verifying Progress in Timed Systems , 1999, ARTS.