Sciweavers

FSTTCS
2010
Springer

Model checking time-constrained scenario-based specifications

13 years 2 months ago
Model checking time-constrained scenario-based specifications
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. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.204
S. Akshay, Paul Gastin, Madhavan Mukund, K. Naraya
Added 11 Feb 2011
Updated 11 Feb 2011
Type Journal
Year 2010
Where FSTTCS
Authors S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Comments (0)