Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics

Forfattere

  • Luca Aceto
  • Francois Laroussinie

DOI:

https://doi.org/10.7146/brics.v6i32.20101

Resumé

This paper studies the structural complexity of model checking
for (variations on) the specification formalisms used in the tools CMC
and Uppaal, and fragments of a timed alternation-free mu-calculus. For
each of the logics we study, we characterize the computational complexity
of model checking, as well as its specification and program complexity,
using timed automata as our system model.

Downloads

Publiceret

1999-12-02

Citation/Eksport

Aceto, L., & Laroussinie, F. (1999). Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. BRICS Report Series, 6(32). https://doi.org/10.7146/brics.v6i32.20101

Nummer

Nr. 32 (1999): RS-32 Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).