Theoretical Computer Science
Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Verification of Context-Free Timed Systems Using Linear Hybrid Observers
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computation: finite and infinite machines
Computation: finite and infinite machines
Automatic Synthesis of Robust and Optimal Controllers --- An Industrial Case Study
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The Effects of Bounding Syntactic Resources on Presburger LTL
Journal of Logic and Computation
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The minimal cost reachability problem in priced timed pushdown systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive) invocations of other timed automata from their collection. During an invocation of a timed automaton, our model permits passing the values of clocks using both pass-byvalue and pass-by-reference mechanisms. We study the natural reachability and termination (reachability with empty invocation stack) problems for recursive timed automata. We show that these problems are decidable (in many cases with the same complexity as the reachability problem on timed automata) for recursive timed automata satisfying the following condition: during each invocation either all clocks are passed by reference or none is passed by reference. Furthermore, we show that for recursive timed automata that violate this condition reachability/termination problems are undecidable for automata with as few as three clocks. We also establish similar results for two-player game extension of our model against reachability/termination objective.