Pages that link to "Item:Q1917074"
From MaRDI portal
The following pages link to On the regularity of Petri net languages (Q1917074):
Displaying 16 items.
- Petri net languages revisited (Q418794) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- A complexity characteristic of Petri net languages (Q1306556) (← links)
- On capacity of labeled Petri net languages (Q1970061) (← links)
- ON YEN'S PATH LOGIC FOR PETRI NETS (Q3016216) (← links)
- Deterministic weak-and-marked Petri net languages are regular (Q3124464) (← links)
- Some results on Petri net languages (Q3493244) (← links)
- Erasing in Petri Net Languages and Matrix Grammars (Q3637250) (← links)
- On Yen’s Path Logic for Petri Nets (Q3646251) (← links)
- (Q3766878) (← links)
- Normal and sinkless Petri nets (Q3974867) (← links)
- (Q4390538) (← links)
- Computing Petri net languages by reductions (Q5055897) (← links)
- (Q5184424) (← links)
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic (Q6044119) (← links)