An Expressive Timed Modal Mu-Calculus for Timed Automata

Rance Cleaveland, Jeroen J.A. Keiren (Corresponding author), Peter Fontana

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

his paper presents a modal mu-calculus, Lrelμ,ν, for encoding properties of systems modeled as timed automata. Our logic includes
arbitrary fixpoints and an until-like modal operator for time elapses, and is shown to be strictly more expressive than existing timed modal mu-calculi introduced in the literature. It also enjoys decidable model checking, as it respects the traditional region-graph construction for timed automata. We additionally establish that, in contrast to the other mu-calculi, Lrel μ,ν is strictly more expressive than Timed Computation Tree Logic (TCTL) in the setting of general timed automata, meaning that model checkers for Lrel μ,ν are immediately usable as model checkers for TCTL for general timed automata
Original languageEnglish
Title of host publicationQuantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems
Subtitle of host publicationFirst International Joint Conference, QEST+FORMATS 2024, Calgary, AB, Canada, September 9–13, 2024, Proceedings
EditorsJane Hillston, Sadegh Soudjani, Masaki Waga
Place of PublicationCham
PublisherSpringer
Pages160-178
Number of pages19
ISBN (Electronic)978-3-031-68416-6
ISBN (Print)978-3-031-68415-9
DOIs
Publication statusPublished - 29 Aug 2024
Event1st International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems, QUEST + FORMATS 2024 - Calgary, Canada
Duration: 9 Sept 202413 Sept 2024

Publication series

NameLecture Notes in Computer Science (LNCS)
Volume14996
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems, QUEST + FORMATS 2024
Abbreviated titleQUEST + FORMATS 2024
Country/TerritoryCanada
CityCalgary
Period9/09/2413/09/24

Fingerprint

Dive into the research topics of 'An Expressive Timed Modal Mu-Calculus for Timed Automata'. Together they form a unique fingerprint.

Cite this