On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap

Authors:
Joel Ouaknine;James Worrell
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Tulane University, New Orleans, LA
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 30

Timed Petri nets and timed automata: On the discriminating power of zeno sequences

Information and Computation
Alternating timed automata

ACM Transactions on Computational Logic (TOCL)
Some Recent Results in Metric Temporal Logic

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
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
Universality Analysis for One-Clock Timed Automata

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Event-Clock Visibly Pushdown Automata

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Security in a Model for Long-running Transactions

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae
When Are Timed Automata Determinizable?

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Weak Alternating Timed Automata

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Time-Bounded Verification

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Supports of Recognizable Timed Series

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Sampled universality of timed automata

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Zone-based universality analysis for single-clock timed automata

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Undecidability of universality for timed automata with minimal resources

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Towards a theory of time-bounded verification

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Memory event clocks

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Exact incremental analysis of timed automata with an SMT-solver

FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Decision problems for the verification of real-time software

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Decidability and complexity results for timed automata via channel machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Undecidable problems about timed automata

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Complexity bounds for the verification of real-time software

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Perturbed timed automata

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Alternating timed automata

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Controller synthesis for MTL specifications

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae
Security in a Model for Long-running Transactions

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Universality Analysis for One-Clock Timed Automata

Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Frequencies in forgetful timed automata

FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...