Modular synthesis of Petri nets from regular languages

MaRDI QIDQ5190771zbMATH OpenFDO

Authors Laure Petrucci, Eric Badouel, Philippe Darondeau

Publication date 27 July 2009

zbMATH Keywords

communication networksdistributed synthesis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Distributing finite automata through Petri net synthesis
• Synthesis of Petri nets from finite partial languages
• Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
• Models from scenarios
• The synthesis problem

Cited in

(5)

• Construction of well-formed Petri nets from standard subnets
• Distributing finite automata through Petri net synthesis
• scientific article; zbMATH DE number 4014040 (Why is no real title available?)
• Deterministic weak-and-marked Petri net languages are regular
• Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages

This page was built for publication: Modular synthesis of Petri nets from regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5190771)