The following pages link to Petri net languages revisited (Q418794):
Displaying 18 items.
- Subset languages of Petri nets. I: The relationship to string languages and normal forms (Q788496) (← links)
- On the properties of the intersection of Petri net languages and context free languages (Q1183784) (← links)
- Process languages and nets (Q1575245) (← links)
- Overview of reconfigurable Petri nets (Q1708190) (← links)
- On the regularity of Petri net languages (Q1917074) (← links)
- On the relationship between the language of the CN-model with component junctions and the language of the detailed Petri model of parallel distributed systems (Q2850346) (← links)
- (Q3350793) (← links)
- Some results on Petri net languages (Q3493244) (← links)
- Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data (Q3564891) (← links)
- How Expressive Are Petri Net Schemata? (Q3618706) (← links)
- Erasing in Petri Net Languages and Matrix Grammars (Q3637250) (← links)
- (Q3736886) (← links)
- (Q3820018) (← links)
- (Q4390538) (← links)
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework (Q4923514) (← links)
- Computing Petri net languages by reductions (Q5055897) (← links)
- (Q5184424) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)