Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
The Expressive Power of Clocks
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Discrete-Time Control for Rectangular Hybrid Automata
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Removing epsilon-Transitions in Timed Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
State Equivalences for Rectangular Hybrid Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th 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
Verifying omega-Regular Properties for a Subclass of Linear Hybrid Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Data-Structures for the Verification of Timed Automata
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
On the Power of Non-Observable Actions in Timed Automata
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Efficient verification of real-time systems: compact data structure and state-space reduction
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Preemptive Job-Shop Scheduling Using Stopwatch Automata
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Journal of Computer and System Sciences
IEEE Transactions on Software Engineering
A Tailored V-Model Exploiting the Theory of Preemptive Time Petri Nets
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
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
Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Model-Based Analysis of Contract-Based Real-Time Scheduling
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Verification of timed and hybrid systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Symbolic and compositional reachability for timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Kleene, Rabin, and Scott are available
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A formal approach to design and verification of two-level hierarchical scheduling systems
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Logic and compositional verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Reachability problems for hybrid automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Interrupt Timed Automata: verification and expressiveness
Formal Methods in System Design
Monitor-Based statistical model checking for weighted metric temporal logic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
Theoretical Computer Science
The Complete Proof Theory of Hybrid Systems
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Efficient computation of quantitative properties of real-time preemptive systems
International Journal of Critical Computer-Based Systems
Development of a Schedulability Analysis Framework Based on pTPN and UPPAAL with Stopwatches
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
Non-markovian analysis for model driven engineering of real-time software
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this paper we define and study the class of stopwatch automata which are timed automata augmented with stopwatches and unobservable behaviour. In particular, we investigate the expressive power of this class of automata, and show as a main result that any finite or infinite timed language accepted by a linear hybrid automaton is also acceptable by a stopwatch automaton. The consequences of this result are two-fold: firstly, it shows that the seemingly minor upgrade from timed automata to stopwatch automata immediately yields the full expressive power of linear hybrid automata. Secondly, reachability analysis of linear hybrid automata may effectively be reduced to reachability analysis of stopwatch automata. This, in turn, may be carried out using an easy (over-approximating) extension of the efficient reachability analysis for timed automata to stopwatch automata. We report on preliminary experiments on analyzing translations of linear hybrid automata using a stopwatch-extension of the real-time verification tool UPPAAL.