The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Specifying real-time properties with metric temporal logic
Real-Time Systems
Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
The benefits of relaxing punctuality
Journal of the ACM (JACM)
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Information and Computation
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation
Model Checking via Reachability Testing for Timed Automata
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Impressive Power of Stopwatches
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
KRONOS: A Model-Checking Tool for Real-Time Systems (Tool-Presentation for FTRTFT '98)
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
Computation: finite and infinite machines
Computation: finite and infinite machines
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Theoretical Computer Science
Task automata: Schedulability, decidability and undecidability
Information and Computation
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Operating System Concepts
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On model-checking timed automata with stopwatch observers
Information and Computation
Real Time Properties for Interrupt Timed Automata
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.While the reachability problem is undecidable for hybrid automata we show that it is decidable for ITA. More precisely we prove that the untimed language of an ITA is regular, by building a finite automaton as a generalized class graph. We then establish that the reachability problem for ITA is in NEXPTIME and in PTIME when the number of clocks is fixed. To prove the first result, we define a subclass ITA驴 of ITA, and show that (1) any ITA can be reduced to a language-equivalent automaton in ITA驴 and (2) the reachability problem in this subclass is in NEXPTIME (without any class graph).In the next step, we investigate the verification of real time properties over ITA. We prove that model checking SCL, a fragment of a timed linear time logic, is undecidable. On the other hand, we give model checking procedures for two fragments of timed branching time logic.We also compare the expressive power of classical timed automata and ITA and prove that the corresponding families of accepted languages are incomparable. The result also holds for languages accepted by controlled real-time automata (CRTA), that extend timed automata. We finally combine ITA with CRTA, in a model which encompasses both classes and show that the reachability problem is still decidable. Additionally we show that the languages of ITA are neither closed under complementation nor under intersection.