Pages that link to "Item:Q1276237"
From MaRDI portal
The following pages link to Decidability of bisimulation equivalence for normed pushdown processes (Q1276237):
Displaying 17 items.
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- A complete normal-form bisimilarity for state (Q2289066) (← links)
- Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols (Q2841265) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- (Q3774929) (← links)
- (Q4222869) (← links)
- (Q4223072) (← links)
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. (Q4608615) (← links)
- Bisimulation Finiteness of Pushdown Systems Is Elementary (Q5145660) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Decidability of DPDA equivalence (Q5941060) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)