Pages that link to "Item:Q1083861"
From MaRDI portal
The following pages link to A logical approach of Petri net languages (Q1083861):
Displaying 19 items.
- Possibilistic Petri nets as a basis for agent service description language (Q598580) (← links)
- Subset languages of Petri nets. I: The relationship to string languages and normal forms (Q788496) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- Towards reasoning about Petri nets: a propositional dynamic logic based approach (Q1786561) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198) (← links)
- Linear logic based calculi for object Petri nets (Q2715877) (← links)
- ON YEN'S PATH LOGIC FOR PETRI NETS (Q3016216) (← links)
- (Q3350793) (← links)
- Some results on Petri net languages (Q3493244) (← links)
- (Q3736886) (← links)
- (Q3805918) (← links)
- Normalization of place/transition-systems preserves net behaviour (Q3991291) (← links)
- (Q4507814) (← links)
- Logical definability of some rational trace languages (Q4850330) (← links)
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework (Q4923514) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- Locally finite languages (Q5941071) (← links)