2026-08-11T18:44:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2864 2024-03-06T10:33:38Z ddc:004 open_access

Model checking time-constrained scenario-based specifications Akshay, S. Gastin, Paul Mukund, Madhavan Narayan Kumar, K. model-checking message-passing system time-constrained MSC We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with timing constraints. Our system model is a network of communicating finite state machines with local clocks, whose global behaviour can be regarded as a timed automaton. Our goal is to verify that all timed behaviours exhibited by the system conform to the timing constraints imposed by the specification. In general, this corresponds to checking inclusion for timed languages, which is an undecidable problem even for timed regular languages. However, we show that we can translate regular collections of time-constrained MSCs into a special class of event-clock automata that can be determinized and complemented, thus permitting an algorithmic solution to the model checking problem. Schloss Dagstuhl – Leibniz-Zentrum für Informatik S. Akshay and Paul Gastin and Madhavan Mukund and K. Narayan Kumar 2010 Is Part Of LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2010.204 urn:nbn:de:0030-drops-28649 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.204 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode