Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
No abstract available.
DOI 10.1007/978-3-642-10672-9_23
Related papers
- Verifying Infinite State Processes with Sequential and Parallel Composition POPL 1995
- Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes CAV 1991
- On the Synthesis of a Reactive Module POPL 1989
- Programmable MCMC with Soundly Composed Guide Programs OOPSLA 2024
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems TACAS 2020
- Faster Signature Refinement for Branching Bisimilarity Minimization TACAS 2026
- Model checking of hierarchical state machines TOPLAS 2001
- On Polynomial Expressions with C-Finite Recurrences in Loops with Nested Nondeterministic Branches CAV 2024