The following pages link to Infinite results (Q6104374):
Displaying 12 items.
- An algebra of behavioural types (Q418153) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Process rewrite systems. (Q1854328) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Petri nets are less expressive than state-extended PA (Q2481981) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- A Basic Parallel Process as a Parallel Pushdown Automaton (Q5170665) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
