On the urgency expressiveness

Authors:
Michaël Adélaïde;Claire Pagetti
Affiliations:
Labri (UMR 5800), Domaine Universitaire, Talence, France;Labri (UMR 5800), Domaine Universitaire, Talence, France
Venue:
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2004

Citing 14
Cited 0

A theory of timed automata

Theoretical Computer Science
The AltaRica formalism for describing concurrent systems

Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
An algebraic framework for urgency

Information and Computation
Timed regular expressions

Journal of the ACM (JACM)
Compositional Specification of Timed Systems (Extended Abstract)

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Modeling Urgency in Timed Systems

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Modular Specification of Hybrid Systems in CHARON

HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
A Kleene/Büchi-like theorem for clock languages

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Compositional and symbolic model-checking of real-time systems

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Reducing the number of clock variables of timed automata

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Compact Data Structures and State-Space Reduction for Model-Checking Real-Time Systems

Real-Time Systems
A partial order semantics approach to the clock explosion problem of timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
A Timed Extension for ALTARICA

Fundamenta Informaticae
Back to the future: towards a theory of timed regular languages

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for finding the minimal number of clocks of a given timed automaton recognizing the language described by a so-called bounded timed regular expressionw. This algorithm is based on the partition of the timed projection of w into so-called delay cells. Using this decomposition, we give a method to compute practically this number for w. We then apply this technique to prove that for some n-clock timed automation we need an additional clock to encode urgency.