On Characteristic Formulae for Event-Recording Automata

  title={On Characteristic Formulae for Event-Recording Automata},
  author={Omer Nguena-Timo and Pierre-Alain Reynier},
A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata (ERA), a subclass of timed automata in which clocks are associated with actions and that enjoys very good closure properties. We first study the problem of expressing characteristic formulae for ERA in Event-Recording Logic (ERL ), a logic introduced by Sorea to express event-based timed specifications. We… 
1 Citations

Figures from this paper

A Decidable Timed μ-calculus for Event-Recording Automata

It is shown decidability of the satisfiability checking problem for a fragment of WTμ called C-WTμ, an extension of the modal μ-calculus with event-recording clocks, to be EXPTIME complete.



Synthesis for a Weak Real-Time Logic

The specification and the controller synthesis problem for real-time systems are considered and it is shown that the satisfiability of C-WTmu is decidable, which means that every formula is equivalent to a formula in disjunctive normal form.

Event-Clock Automata: A Determinizable Class of Timed Automata

A Theory of Timed Automata

Characteristic formulae for timed automata

This paper offers characteristic formula constructions in the real-time logic L v for several behavioural relations between (states of) timed automata. The behavioural relations studied in this work

A Logical Characterisation of Event Clock Automata

  • D. D'Souza
  • Computer Science
    Int. J. Found. Comput. Sci.
  • 2003
The class of Event Clock Automata is shown to admit a logical characterisation via an unrestricted monadic second order logic interpreted over timed words that provides an unrestricted yet decidable logicalCharacterisation of a non-trivial class of timed languages.

Characteristic Formulae for Processes with Divergence

This paper builds the theoretical basis for a uniform and efficient method to automatically verify bisimulation-like relations between processes by means of model checking and demonstrates the expressive power of intuitionistically interpreted Hennessy-Milner Logic with mutual recursion.

A linear-time model-checking algorithm for the alternation-free modal mu-calculus

A model-checking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations is developed, which improves on the best known algorithm for similar fixed-point logics.

Is your model checker on time? On the complexity of model checking for timed modal logics

From Timed Automata to Logic - and Back

A timed logic L v is defined which is sufficiently expressive that for any timed automaton may construct a single characteristic L v formula uniquely characterizing the automaton up to timed bisimilarity.

Definable Operation in General Algebras, and the Theory of Automata and Flowcharts

  • H. Bekic
  • Mathematics
    Programming Languages and Their Definition
  • 1984
Two theorems on definable operations are obtained that give us as special case the regular-equals-recognisable theorem of generalised finite automata theory and Manna's formulas for termination and correctness of flowcharts.