Pages that link to "Item:Q1849592"
From MaRDI portal
The following pages link to Distributing finite automata through Petri net synthesis (Q1849592):
Displaying 21 items.
- Modeling and synthesis for supervisory control on Petri nets for distributed objects. II. A supervisor synthesis method for a set of general form sequences (Q650043) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- Synthesising elementary net systems with localities (Q2077411) (← links)
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues (Q2165238) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Petri Net Synthesis for Restricted Classes of Nets (Q2822652) (← links)
- On Distributability of Petri Nets (Q2892781) (← links)
- Synchrony versus causality in distributed systems (Q2971080) (← links)
- Distributed Control of Discrete-Event Systems: A First Step (Q4909348) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (Q5019696) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues (Q5044399) (← links)
- Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account (Q5100747) (← links)
- k-Bounded Petri Net Synthesis from Modal Transition Systems. (Q5111618) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)