| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Safe CCSL Specifications and Marked Graphs
Abstract : The Clock Constraint Specification Language (CCSL) proposes a rich polychronous time model dedicated to the specification of constraints on logical clocks: i.e., sequences of event occurrences. A priori independent clocks are progressively constrained through a set of clock operators that define when an event may occur or not. These operators can be described as labeled transition systems that can potentially have an infinite number of states. A CCSL specification can be scheduled by performing the synchronized product of the transition systems for each operator. Even when some of the composed transition systems are infinite, the number of reachable states in the product may still be finite: the specification is safe. The purpose of this paper is to propose a sufficient condition to detect that the product is actually safe. This is done by abstracting each CCSL constraint (relation and expression) as a marked graph. Detecting that some specific places, called counters, in the resulting marked graph are safe is sufficient to guarantee that the composition is safe.
Cited literature [23 references]
https://hal.inria.fr/hal-00913962
Contributor : Team Kairos Connect in order to contact the contributor
Submitted on : Thursday, December 5, 2013 - 10:43:17 AM
Last modification on : Friday, January 21, 2022 - 3:16:14 AM
Long-term archiving on: : Thursday, March 6, 2014 - 1:25:11 AM
Contributor : Team Kairos Connect in order to contact the contributor
Submitted on : Thursday, December 5, 2013 - 10:43:17 AM
Last modification on : Friday, January 21, 2022 - 3:16:14 AM
Long-term archiving on: : Thursday, March 6, 2014 - 1:25:11 AM
File
memocodePub.pdf
Files produced by the author(s)