Parosh Aziz Abdulla
Mohamed Faouzi Atig
Jari Stenman
2012
Dense-Timed Pushdown Automata
Proc. 27th LICS
IEEE Computer Society
35–44
10.1109/LICS.2012.15
Rajeev Alur
David L. Dill
1994
A Theory of Timed Automata
Theoretical Computer Science
126
2
183–235
10.1016/0304-3975(94)90010-8
Rajeev Alur
Kousha Etessami
Parthasarathy Madhusudan
2004
A Temporal Logic of Nested Calls and Returns
Proc. 10th TACAS
LNCS
2988
Springer
467–481
10.1007/978-3-540-24730-2_35
Rajeev Alur
Tomás Feder
Thomas A. Henzinger
1996
The Benefits of Relaxing Punctuality
J. ACM
43
1
116–146
10.1145/227595.227602
Rajeev Alur
Limor Fix
Thomas A. Henzinger
1999
Event-Clock Automata: A Determinizable Class of Timed Automata
Theoretical Computer Science
211
1-2
253–273
10.1016/S0304-3975(97)00173-4
Rajeev Alur
Thomas A. Henzinger
1993
Real-Time Logics: Complexity and Expressiveness
Inf. Comput.
104
1
35–77
10.1006/inco.1993.1025
Rajeev Alur
Parthasarathy Madhusudan
2004
Visibly Pushdown Languages
Proc. 36th STOC
ACM
202–211
10.1145/1007352.1007390
Christel Baier
Joost-Pieter Katoen
2008
Principles of Model Checking
The MIT Press
Massimo Benerecetti
Stefano Minopoli
Adriano Peron
2010
Analysis of Timed Recursive State Machines
TIME 2010 - 17th International Symposium on Temporal Representation and Reasoning, Paris, France, 6-8 September 2010
61–68
10.1109/TIME.2010.10
Massimo Benerecetti
Adriano Peron
2016
Timed recursive state machines: Expressiveness and complexity
Theoretical Computer Science
625
85–124
10.1016/j.tcs.2016.02.021
Devendra Bhave
Vrunda Dave
Shankara Narayanan Krishna
Ramchandra Phawade
Ashutosh Trivedi
2016
A Logical Characterization for Dense-Time Visibly Pushdown Automata
Proc. 10th LATA
LNCS
9618
Springer
89–101
10.1007/978-3-319-30000-9_7
Ahmed Bouajjani
Rachid Echahed
Riadh Robbana
1994
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures
Hybrid Systems II
64–85
10.1007/3-540-60472-3_4
L. Bozzelli
A. Murano
A. Peron
2010
Pushdown Module Checking.
Formal Methods in System Design
36
1
65–95
10.1007/s10703-010-0093-x
L. Bozzelli
A. Peron
A. Murano
2018
Event-clock Nested Automata
Proc. 12th LATA
LNCS 10792
Springer
80–92
10.1007/978-3-319-77313-1_6
Laura Bozzelli
Aniello Murano
Adriano Peron
2018
Timed contex-free temporal logics (extended version)
http://arxiv.org/abs/1808.04271
http://arxiv.org/abs/1808.04271
K. Chatterjee
D. Ma
R. Majumdar
T. Zhao
T.A. Henzinger
J. Palsberg
2003
Stack Size Analysis for Interrupt-Driven Programs
Proc. 10th SAS
LNCS 2694
Springer
109–126
10.1007/3-540-44898-5_7
Lorenzo Clemente
Slawomir Lasota
2015
Timed Pushdown Automata Revisited
Proc. 30th LICS
IEEE Computer Society
738–749
10.1109/LICS.2015.73
Michael Emmi
Rupak Majumdar
2006
Decision Problems for the Verification of Real-Time Software
Proc. 9th HSCC
LNCS
3927
Springer
200–211
10.1007/11730637_17
Ron Koymans
1990
Specifying Real-Time Properties with Metric Temporal Logic
Real-Time Systems
2
4
255–299
10.1007/BF01995674
M.L. Minsky
1967
Computation: Finite and Infinite Machines
Prentice-Hall, Englewood Cliffs
Joël Ouaknine
James Worrell
2006
On Metric Temporal Logic and Faulty Turing Machines
Proc. 9th FOSSACS
LNCS 3921
Springer
217–230
10.1007/11690634_15
Joël Ouaknine
James Worrell
2007
On the decidability and complexity of Metric Temporal Logic over finite words
Logical Methods in Computer Science
3
1
10.2168/LMCS-3(1:8)2007
Jean-François Raskin
Pierre-Yves Schobbens
1999
The Logic of Event Clocks - Decidability, Complexity and Expressiveness
Journal of Automata, Languages and Combinatorics
4
3
247–286
Nguyen Van Tang
Mizuhito Ogawa
2009
Event-Clock Visibly Pushdown Automata
Proc. 35th SOFSEM
LNCS
5404
Springer
558–569
10.1007/978-3-540-95891-8_50
Ashutosh Trivedi
Dominik Wojtczak
2010
Recursive Timed Automata
Proc. 8th ATVA
LNCS
6252
Springer
306–324
10.1007/978-3-642-15643-4_23
I. Walukiewicz
1996
Pushdown Processes: Games and Model Checking.
CAV'96
62–74
10.1007/3-540-61474-5_58