Communication and concurrency
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Timed automata and additive clock constraints
Information Processing Letters
Timed automata with periodic clock constraints
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance
Formal Methods in System Design
Verifying ET-LOTOS programmes with KRONOS
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
CMC: A Tool for Compositional Model-Checking of Real-Time Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
The Expressive Power of Clocks
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Removing epsilon-Transitions in Timed Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
On the Power of Non-Observable Actions in Timed Automata
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Computation: finite and infinite machines
Computation: finite and infinite machines
Static guard analysis in timed automata verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Improved undecidability results on weighted timed automata
Information Processing Letters
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
On conciseness of extensions of timed automata
Journal of Automata, Languages and Combinatorics
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Theoretical Computer Science
Updatable Timed Automata with Additive and Diagonal Constraints
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A Decidable Probability Logic for Timed Probabilistic Systems
Fundamenta Informaticae
Testing Real-Time Systems Using TINA
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
On identification of input/output extended automata with finite bisimilar quotients
ACC'09 Proceedings of the 2009 conference on American Control Conference
Improved undecidability results on weighted timed automata
Information Processing Letters
Analysis and applications of timed service protocols
ACM Transactions on Software Engineering and Methodology (TOSEM)
From time Petri nets to timed automata: an untimed approach
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Timed petri nets and timed automata: on the discriminating power of zeno sequences
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
Theoretical Computer Science
A machine-independent characterization of timed languages
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Avoiding shared clocks in networks of timed automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
ACM Computing Surveys (CSUR)
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Model checking for probabilistic timed automata
Formal Methods in System Design
Hi-index | 5.23 |
We investigate extensions of Alur and Dill's timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting decidable subclasses. In a surprising way, decidability depends on the nature of the clock constraints which are used, diagonal-free or not, whereas these constraints play identical roles in timed automata. We thus describe in a quite precise way the thin frontier between decidable and undecidable classes of updatable timed automata.We also study the expressive power of updatable timed automata. It turns out that any up-datable automaton belonging to some decidable subclass can be effectively transformed into an equivalent timed automaton without updates but with silent transitions. The transformation suffers from an enormous combinatorics blow-up which seems unavoidable. Therefore, updatable timed automata appear to be a concise model for representing and analyzing large classes of timed systems.