Priority in Logical Time Partial Orders with Synchronous Relations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Priority in Logical Time Partial Orders with Synchronous Relations

Abstract

The Clock Constraint Specification Language (CCSL) offers constructs for expressing chronological and causal relations on events of an embedded system. CCSL simulator, TimeSquare allows one to visualize executions of the specified systems by determining step by step sets of synchronously occurring events. When several different sets of events are possible at a given step, the simulator uses a global simulation policy to choose one. However, this mechanism does not consider any priority between events. Inspired by priority in Petri nets, we show how to formally define a priority system supporting possibly synchronous partial orders of events. Both formal definitions and an efficient implementation are presented.
Fichier principal
Vignette du fichier
RIVF19_priority.pdf (214.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02078493 , version 1 (25-03-2019)

Identifiers

  • HAL Id : hal-02078493 , version 1

Cite

Régis Gascon, Julien Deantoni, Jean-François Le Tallec. Priority in Logical Time Partial Orders with Synchronous Relations. IEEE RIVF 2019 - Research, Innovation and Vision for the Future, Mar 2019, Danang, Vietnam. ⟨hal-02078493⟩
66 View
118 Download

Share

Gmail Facebook Twitter LinkedIn More