P. A. Abdulla, M. F. Atig & J. Stenman (2012):
Dense-timed pushdown automata.
In: Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on.
IEEE,
doi:10.1109/LICS.2012.15.
P. A. Abdulla, M. F. Atig & J. Stenman (2012):
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems.
In: LATA,
doi:10.1007/978-3-642-28332-1_6.
P. A. Abdulla, P. Mahata & R. Mayr (2005):
Decidability of Zenoness, syntactic boundedness and token-liveness for dense-timed petri nets.
In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science.
Springer,
pp. 58–70,
doi:10.1007/978-3-540-30538-5_6.
R. Alur (1991):
Techniques for Automatic Verification of Real-Time Systems.
Dept. of Computer Sciences, Stanford University.
R. Alur & D. L. Dill (1990):
Automata For Modeling Real-Time Systems.
In: ICALP,
LNCS 443.
Springer,
pp. 322–335,
doi:10.1007/BFb0032042.
R. Alur & D. L. Dill (1994):
A Theory of Timed Automata.
Theor. Comput. Sci. 126(2),
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
M. Benerecetti, S. Minopoli & A. Peron (2010):
Analysis of Timed Recursive State Machines.
In: TIME.
IEEE Computer Society,
pp. 61–68,
doi:10.1109/TIME.2010.10.
A. Bouajjani, R. Echahed & R. Robbana (1994):
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures.
In: Hybrid Systems,
LNCS 999.
Springer,
pp. 64–85,
doi:10.1007/3-540-60472-3_4.
A. Bouajjani, J. Esparza & O. Maler (1997):
Reachability Analysis of Pushdown Automata: Application to Model-Checking.
In: CONCUR,
LNCS 1243.
Springer,
pp. 135–150,
doi:10.1007/3-540-63141-0_10.
P. Bouyer, F. Cassez, E. Fleury & K. G. Larsen (2004):
Optimal Strategies in Priced Timed Game Automata.
In: FSTTCS,
LNCS 3328.
Springer,
pp. 148–160,
doi:10.1007/978-3-540-30538-5_13.
P. Bouyer & F. Laroussinie (2008):
Model Checking Timed Automata.
In: Stephan Merz & Nicolas Navet: Modeling and Verification of Real-Time Systems.
ISTE Ltd. – John Wiley & Sons, Ltd.,
pp. 111–140,
doi:10.1002/9780470611012.ch4.
Z. Dang (2003):
Pushdown timed automata: a binary reachability characterization and safety verification.
Theor. Comput. Sci. 302(1-3),
pp. 93–121,
doi:10.1016/S0304-3975(02)00743-0.
Z. Dang, T. Bultan, O. H. Ibarra & R. A. Kemmerer (2004):
Past pushdown timed automata and safety verification.
Theor. Comput. Sci. 313(1),
pp. 57–71,
doi:10.1016/j.tcs.2003.10.004.
Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer & J. Su (2000):
Binary Reachability Analysis of Discrete Pushdown Timed Automata.
In: CAV,
LNCS 1855.
Springer,
pp. 69–84,
doi:10.1007/10722167_9.
M. Emmi & R. Majumdar (2006):
Decision Problems for the Verification of Real-Time Software.
In: HSCC,
LNCS 3927.
Springer,
pp. 200–211,
doi:10.1007/11730637_17.
J. Esparza, D. Hansel, P. Rossmanith & S. Schwoon (2000):
Efficient Algorithms for Model Checking Pushdown Systems.
In: CAV,
LNCS 1855.
Springer,
doi:10.1007/10722167_20.
J. Esparza & S. Schwoon (2001):
A BDD-Based Model Checker for Recursive Programs.
In: CAV,
LNCS 2102.
Springer,
pp. 324–336,
doi:10.1007/3-540-44585-4_30.
F. Herbreteau, B. Srivathsan & I. Walukiewicz (2012):
Efficient emptiness check for timed büchi automata.
Formal Methods in System Design 40(2),
pp. 122–146,
doi:10.1007/s10703-011-0133-1.
A. Heußner, J. Leroux, A. Muscholl & G. Sutre (2012):
Reachability Analysis of Communicating Pushdown Systems.
Logical Methods in Computer Science 8(3:23),
pp. 1–20,
doi:10.2168/LMCS-8(3:23)2012.
S. Schwoon (2002):
Model-Checking Pushdown Systems.
Technische Universität München.
S. Tripakis (1999):
Verifying Progress in Timed Systems.
In: ARTS,
LNCS 1601.
Springer,
pp. 299–314,
doi:10.1007/3-540-48778-6_18.
A. Trivedi & D. Wojtczak (2010):
Recursive timed automata.
In: Proceedings of the 8th international conference on Automated technology for verification and analysis,
ATVA,
pp. 306–324,
doi:10.1007/978-3-642-15643-4_23.
eptcs@eptcs.org