Pages that link to "Item:Q1424356"
From MaRDI portal
The following pages link to Strong bisimilarity of simple process algebras: Complexity lower bounds (Q1424356):
Displaying 12 items.
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- (Q4223072) (← links)
- Complexity of weak bisimilarity and regularity for BPA and BPP (Q4461214) (← links)
- (Q4736869) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- Resource Bisimilarity in Petri Nets is Decidable (Q5038572) (← links)
- Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463) (← links)
- Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences (Q5179048) (← links)