Skip to Main content Skip to Navigation
Conference papers

Symbolically Bounding the Drift in Time-Constrained MSC-Graphs

Abstract : Verifying systems involving both time and concurrency rapidly leads to undecidability, and requires restrictions to become eff ective. This paper addresses the emptiness problem for time-constrained MSC-Graphs (TC-MSC graphs for short), that is, checking whether there is a timed execution compatible with a TC-MSC graph speci cation. This problem is known to be undecidable in general [11], and decidable for some regular speci cations [11]. We establish decidability of the emptiness problem under the condition that, for a given K, no path of the TC-MSC graph forces any node to take more than K time units to complete. We prove that this condition can be e ffectively checked. The proofs use a novel symbolic representation for runs, where time constraints are encoded as a system of inequalities. This allows us to handle non-regular speci cations and improve effi ciency w.r.t. using interleaved representations.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Loic Helouet <>
Submitted on : Tuesday, November 5, 2013 - 12:10:34 PM
Last modification on : Tuesday, June 15, 2021 - 4:15:01 PM
Long-term archiving on: : Thursday, February 6, 2014 - 4:34:42 AM


Files produced by the author(s)


  • HAL Id : hal-00879831, version 1


Sundararaman Akshay, Blaise Genest, Loic Helouet, Shaofa Yang. Symbolically Bounding the Drift in Time-Constrained MSC-Graphs. International Colloquium on Theoretical Aspects of Computing, IIT Bangalore, Sep 2012, Bangalore, India. pp.1-15. ⟨hal-00879831⟩



Record views


Files downloads