A Decidable Timed mu-calculus for Event-Recording AutomataReport as inadecuate




A Decidable Timed mu-calculus for Event-Recording Automata - Download this document for free, or read online. Document in PDF available to download.

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Abstract : The Logic WTmu is considered. We show decidability of the satisfiability checking problem for a fragment of WTmu called C-WTmu. WTmu~ is an extension of the modal mu-calculus with event-recording clocks. C-WTmu~ is more expressive than Event-Recording logic, another EXPTIME complete decidable extension of the modal mu-calculus with event-recording clocks. Based on the techniques for deciding untimed mu-calculus, we present a set of rules for constructing tableaux for formulas of C-WTmu. The decidability problem is shown to be EXPTIME complete. We construct a witness event-recording automaton that satisfies a given C-\WTmu~formula.

Keywords : WTmu event-recording automata satisfiability tableau timed mu-calculus model-checking





Author: Omer Landry Nguena Timo -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents