Pages that link to "Item:Q5941202"
From MaRDI portal
The following pages link to Deciding bisimulation-like equivalences with finite-state processes (Q5941202):
Displaying 17 items.
- Regularity of normed PA processes (Q294692) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- Petri nets are less expressive than state-extended PA (Q2481981) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- On Symbolic Verification of Weakly Extended PAD (Q2866343) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← 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)
