The following pages link to Infinite results (Q6104374):
Displaying 23 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 Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- (Q5014795) (← 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)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)
- Basic process algebra with deadlocking states (Q5958771) (← links)
