A Kleene/Büchi-like theorem for clock languages

Authors:
Patricia Bouyer;Antoine Petit
Affiliations:
LSV, CNRS UMR 8643, ENS de Cachan 61, Avenue du Prisident Wilson, F-94230 Cachan Cedex, France;LSV, CNRS UMR 8643, ENS de Cachan 61, Avenue du Prisident Wilson, F-94230 Cachan Cedex, France
Venue:
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Year:
2001

Citing 17
Cited 20

Automata for modeling real-time systems

Proceedings of the seventeenth international colloquium on Automata, languages and programming
A theory of timed automata

Theoretical Computer Science
Symbolic model checking for real-time systems

Information and Computation
Untiming timed languages

Information Processing Letters
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Model checking

Model checking
Timed automata with periodic clock constraints

Journal of Automata, Languages and Combinatorics
The Expressive Power of Clocks

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Controlled Timed Automata

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
Equations on Timed Languages

HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Are Timed Automata Updatable?

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Minimum and Maximum Delay Problems in Real-Time Systems

CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A Determinizable Class of Timed Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Kleene theorem for timed automata

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

Timed regular expressions

Journal of the ACM (JACM)
A logical characterization of data languages

Information Processing Letters
Automata on Linear Orderings

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Algebraic Characterization of Data and Timed Languages

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
An algebraic approach to data languages and timed languages

Information and Computation
A Kleene theorem for splitable signals

Information Processing Letters
Kleene theorems for skew formal power series

Acta Cybernetica
Static analysis of XML processing with data values

ACM SIGMOD Record
Iteration Semirings

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae
On Equivalences for a Class of Timed Regular Expressions

Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy regular languages over finite and infinite words

Fuzzy Sets and Systems
Automata on linear orderings

DLT'02 Proceedings of the 6th international conference on Developments in language theory
Kleene revisited by Suschkewitsch

Acta Cybernetica
Regular expressions with timed dominoes

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A Kleene-Schützenberger theorem for weighted timed automata

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Kleene-Schützenberger theorem for weighted timed automata

Theoretical Computer Science
On the urgency expressiveness

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae
Generating functions of timed languages

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose in this paper a generalization of the famous Kleene/Büchi's theorem on formal languages, one of the cornerstones of theoretical computer science, to the timed model of clock languages. These languages extend the now classical timed languages introduced by Alur and Dill as a suitable model for real-time systems. As a corollary of our main result, we get a simple algebraic characterization of timed languages recognized by (updatable) timed automata.