Pages that link to "Item:Q2365394"
From MaRDI portal
The following pages link to Computable processes and bisimulation equivalence (Q2365394):
Displaying 14 items.
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
- Bisimulation for higher-order process calculi (Q675066) (← links)
- Two finite specifications of a queue (Q1391797) (← links)
- Strong bisimilarity of simple process algebras: Complexity lower bounds (Q1424356) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- Process Bisimulation Via a Graphical Encoding (Q3541958) (← links)
- (Q3774929) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- (Q4733426) (← links)
- Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463) (← links)
- Linearization in parallel pCRL (Q5946027) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)