The following pages link to Trace nets and process automata (Q1902303):
Displaying 13 items.
- Tile formats for located and mobile systems. (Q1854326) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Fault model identification and synthesis in Petri nets (Q2348378) (← links)
- Identification of Petri nets from knowledge of their language (Q2465425) (← links)
- Structural non-interference in elementary and trace nets (Q3655757) (← links)
- Process discovery and Petri nets (Q3655758) (← 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)
- Stratified petri nets (Q5055926) (← links)
- Synthesis of nets with inhibitor arcs (Q6044115) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)