Pages that link to "Item:Q5941099"
From MaRDI portal
The following pages link to Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099):
Displaying 10 items.
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Complexity results for problems of communication-free Petri nets and related formalisms (Q2805419) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- (Q4527145) (← links)
- On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions (Q5060067) (← links)
- (Q5207052) (← links)