Model checking time-constrained scenario-based specifications

Authors S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2010.204.pdf
  • Filesize: 0.59 MB
  • 12 pages

Document Identifiers

Author Details

S. Akshay
Paul Gastin
Madhavan Mukund
K. Narayan Kumar

Cite As Get BibTex

S. Akshay, Paul Gastin, Madhavan Mukund, and K. Narayan Kumar. Model checking time-constrained scenario-based specifications. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 204-215, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/LIPIcs.FSTTCS.2010.204

Abstract

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.

Subject Classification

Keywords
  • model-checking
  • message-passing system
  • time-constrained MSC

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail