Model checking time-constrained scenario-based specifications

Akshay, S. ; Gastin, Paul ; Mukund, Madhavan ; Narayan Kumar, K. (2010) Model checking time-constrained scenario-based specifications In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), 15-18 Dec 2010, Chennai, India.

PDF - Other


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.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Schloss Dagstuhl-Leibniz Center for Informatics.
Keywords:Model-Checking; Message-Passing System; Time-Constrained MSC
ID Code:114140
Deposited On:25 May 2018 04:37
Last Modified:25 May 2018 04:37

Repository Staff Only: item control page