Checking conformance for time-constrained scenario-based specifications

We consider the problem of model checking message-passing systems with real-time requirements. As behavioral 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 behavior can be regarded as a timed automaton. Our goal is to verify that all timed behaviors 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/conformance problem.

Authors

• S. Akshay Indian Institute of Technology Bombay, Mumbai, India
• Paul Gastin
• Madhavan Mukund
• K. Narayan Kumar

Keywords

• MSC graphs
• Timed automata
• Model checking