Distributed Behavioral Cartography of Timed Automata

André, Étienne; Coti, Camille; Évangelista, Sami

doi:10.1145/2642769.2642784

Cited by 4 publications

(7 citation statements)

References 13 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we will use a third master-workers distribution method, that dynamically splits the parametric domain V in subparts: when a worker completes the covering of its subpart, the master splits another subpart into two parts, and assigns one of the two part to that worker. From our results, this algorithm (implemented in the working version of Imitator) is more efficient than the two algorithms of [4].…”

Section: A Sequential Point Enumeration: Each Integer Point Not Yet Cmentioning

confidence: 87%

“…In [4], we proposed two distribution algorithms to execute BC on a set of computers (e.g., on a cluster), implemented in Imitator using the message passing interface Fig. 3: EF-synthesis using PRPC and EFsynth for A 1 (MPI).…”

Section: Towards Distributed Parameter Synthesismentioning

confidence: 99%

“…Hence, the critical question is how to distribute efficiently the reference valuations ("points") on which to call IM. In [4], we proposed a master-workers scheme, where a master distributes the points to the workers, using two point distribution algorithms:…”

Section: Towards Distributed Parameter Synthesismentioning

confidence: 99%

“…Of course, comparing a distributed algorithm (PRPC) with a monolithic one (EFsynth) is unfair. However, to the best of our knowledge, no distributed algorithm for parameter synthesis has been proposed (except [4]). One could argue that EFsynth could at least take advantage of multi-cores, e.g., using one core to compute the successor states while another performs the (costly) equality check, or by computing in parallel the successor states of several statesbut PRPC could take advantage of exactly the same enhancements.…”

Section: A Sequential Point Enumeration: Each Integer Point Not Yet Cmentioning

confidence: 99%

“…The code was compiled using OCaml 3.12.1. The message-passing library we used is Bull's OpenMPI variant for Bullx, and the nodes are interconnected by a 40 Gb/s InfiniBand network 4.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Reachability Preservation Based Parameter Synthesis for Timed Automata

André

Lipari

Nguyen

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The synthesis of timing parameters consists in deriving conditions on the timing constants of a concurrent system such that it meets its specification. Parametric timed automata are a powerful formalism for parameter synthesis, although most problems are undecidable. We first address here the following reachability preservation problem: given a reference parameter valuation and a (bad) control state, do there exist other parameter valuations that reach this control state iff the reference parameter valuation does? We show that this problem is undecidable, and introduce a procedure that outputs a possibly underapproximated answer. We then show that our procedure can efficiently replace the behavioral cartography to partition a bounded parameter subspace into good and bad subparts; furthermore, our procedure can even outperform the classical bad-state driven parameter synthesis semi-algorithm, especially when distributed on a cluster.

show abstract

Section: A Sequential Point Enumeration: Each Integer Point Not Yet Cmentioning

confidence: 87%

Section: Towards Distributed Parameter Synthesismentioning

confidence: 99%

Section: Towards Distributed Parameter Synthesismentioning

confidence: 99%

Section: A Sequential Point Enumeration: Each Integer Point Not Yet Cmentioning

confidence: 99%

“…The code was compiled using OCaml 3.12.1. The message-passing library we used is Bull's OpenMPI variant for Bullx, and the nodes are interconnected by a 40 Gb/s InfiniBand network 4.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Reachability Preservation Based Parameter Synthesis for Timed Automata

André

Lipari

Nguyen

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

André

2021

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Real-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by 3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.

show abstract