A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata

Balaguer, Sandie; Chatain, Thomas; Haar, Stefan

doi:10.1109/time.2010.12

Cited by 5 publications

(1 citation statement)

References 26 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So far, their expressiveness was compared [BCH + 05, BR08, CR06, Srb08] essentially in terms of sequential semantics that forget concurrency. In [BCH12], we defined a concurrency-preserving translation from time Petri nets to networks of timed automata. This transformation uses shared clocks and the question whether these could be avoided remained open.…”

Section: Introductionmentioning

confidence: 99%

Avoiding Shared Clocks in Networks of Timed Automata

Balaguer

Chatain

2013

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks, i.e. transitions of one automaton may be guarded by conditions on the value of clocks reset by another automaton. This is a problem when one considers implementing such model in a distributed architecture, since reading clocks a priori requires communications which are not explicitly described in the model. We focus on the following question: given an NTA A1 A2 where A2 reads some clocks reset by A1, does there exist an NTA Awithout shared clocks with the same behavior as the initial NTA? For this, we allow the automata to exchange information during synchronizations only, in particular by copying the value of their neighbor's clocks. We discuss a formalization of the problem and define an appropriate behavioural equivalence. Then we give a criterion using the notion of contextual timed transition system, which represents the behavior of A2 when in parallel with A1. Finally, we effectively build A

show abstract

Section: Introductionmentioning

confidence: 99%

Avoiding Shared Clocks in Networks of Timed Automata

Balaguer

Chatain

2013

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Conformance Relations for Labeled Event Structures

León¹,

Haar²,

Longuet³

2012

Tests and Proofs

View full text Add to dashboard Cite

International audienceWe propose a theoretical framework for testing concurrent systems from true concurrency models like Petri nets or networks of automata. The underlying model of computation of such formalisms are labeled event structures, which allow to represent concurrency explicitly. The activity of testing relies on the definition of a conformance relation that depends on the observable behaviors on the system under test, which is given for sequential systems by ioco type relations. However, these relations are not capable of capturing and exploiting concurrency of non sequential behavior. We study different conformance relations for labeled event structures, relying on different notions of observation, and investigate their properties and connections

show abstract