Skip to Main content Skip to Navigation
Reports

Modular Automata 2 Distributed Petri Nets 4 Synthesis

Philippe Darondeau 1 Laure Petrucci 2
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Modular automata are symbolic transition systems halfway between families of automata and their synchronized products. They allow for analysis of liveness properties without incurring the state space explosion problem. A modular automaton is composed of modules and a synchronization graph. We consider the problem whether such specifications may be implemented by a distributed Petri net up to language equivalence. The challenge is to avoid computing the state space of the modular automaton to be implemented. We show that this is possible, opening the way to the synthesis of nets from modular specifications.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00148133
Contributor : Philippe Darondeau <>
Submitted on : Tuesday, May 22, 2007 - 10:23:28 AM
Last modification on : Thursday, January 7, 2021 - 4:35:28 PM
Long-term archiving on: : Tuesday, September 21, 2010 - 12:48:31 PM

Files

RR-6192.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00148133, version 2

Citation

Philippe Darondeau, Laure Petrucci. Modular Automata 2 Distributed Petri Nets 4 Synthesis. [Research Report] RR-6192, INRIA. 2007. ⟨inria-00148133v2⟩

Share

Metrics

Record views

390

Files downloads

342