The following pages link to Decidability of DPDA equivalence (Q5941060):
Displaying 42 items.
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- A logic of separating modalities (Q290917) (← links)
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- Model-checking process equivalences (Q477208) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata (Q801689) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Some negative results concerning DPDA's (Q1058306) (← links)
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable (Q1075060) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus (Q1706163) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Decidability of the equivalence problem for deterministic pushdown automata (Q1816326) (← links)
- Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Generalized abstraction-refinement for game-based CTL lifted model checking (Q2193289) (← links)
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Nested session types (Q2233456) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator (Q2372202) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Equivalence of deterministic pushdown automata revisited (Q2458041) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- On the decidability of the PVD class with equality (Q2743641) (← links)
- Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols (Q2841265) (← links)
- Model-checking games for typed \(\lambda\)-calculi (Q2864164) (← links)
- Modular games for coalgebraic fixed point logics (Q2873663) (← links)
- A Propositional Dynamic Logic for CCS Programs (Q3511450) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- A Complete Axiomatic System for a Process-Based Spatial Logic (Q3599152) (← links)
- Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
- A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)
- System \(F^\mu_\omega\) with context-free session types (Q6535246) (← links)
- Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses (Q6647302) (← links)
