Distributing finite automata through Petri net synthesis
From MaRDI portal
Publication:1849592
DOI10.1007/s001650200022zbMath1017.68062OpenAlexW2003244731MaRDI QIDQ1849592
Benoît Caillaud, Philippe Darondeau, Eric Badouel
Publication date: 1 December 2002
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001650200022
Related Items (21)
The synthesis of Petri nets from path-automatic specifications ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Hardness Results for the Synthesis of b-bounded Petri Nets ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Synchrony versus causality in distributed systems ⋮ Unnamed Item ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Distributed Control of Discrete-Event Systems: A First Step ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Target-oriented Petri Net Synthesis ⋮ Synthesising elementary net systems with localities ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ The Complexity of Synthesis of b-Bounded Petri Nets ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized
This page was built for publication: Distributing finite automata through Petri net synthesis
