Theoretical Computer Science
An Efficient Algorithm for Minimizing Real-Time Transition Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Reducing the number of clock variables of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
A game approach to determinize timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Off-line test selection with test purposes for non-deterministic timed automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A machine-independent characterization of timed languages
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.89 |
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not algorithmically solvable. Minimizing the "resources" of a TA (number of clocks or size of constants) are also unsolvable problems. In this paper we provide simple undecidability proofs using a "constructive" version of the problems where we require not just a yes/no answer, but also a "witness". Proofs are then simple reductions from the universality problem. Recent work of Finkel shows that the corresponding decision problems are also undecidable [O. Finkel, On decision problems for timed automata, Bulletin of the European Association for Theoretical Computer Science 87 (2005) 185-190].