Pages that link to "Item:Q5096742"
From MaRDI portal
The following pages link to High undecidability of weak bisimilarity for Petri nets (Q5096742):
Displaying 6 items.
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- (Q4270058) (← links)