A machine-independent characterization of timed languages

Authors:
Mikołaj Bojańczyk;Sławomir Lasota
Affiliations:
Institute of Informatics, University of Warsaw, Poland;Institute of Informatics, University of Warsaw, Poland
Venue:
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Year:
2012

Citing 12
Cited 4

A theory of timed automata

Theoretical Computer Science
Finite-memory automata

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)
Timed automata with periodic clock constraints

Journal of Automata, Languages and Combinatorics
Minimization of Timed Transition Systems

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Minimizable Timed Automata

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
An algebraic approach to data languages and timed languages

Information and Computation
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Updatable timed automata

Theoretical Computer Science
Folk theorems on the determinization and minimization of timed automata

Information Processing Letters
Automata with Group Actions

LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Undecidable problems about timed automata

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems

Fraenkel-Mostowski sets with non-homogeneous atoms

RP'12 Proceedings of the 6th international conference on Reachability Problems
Full abstraction for nominal Scott domains

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimization of symbolic automata

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Turing Machines with Atoms

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use a variant of Fraenkel-Mostowski sets (known also as nominal sets) as a framework suitable for stating and proving the following two results on timed automata. The first result is a machine-independent characterization of languages of deterministic timed automata. As a second result we define a class of automata, called by us timed register automata, that extends timed automata and is effectively closed under minimization.