On the public citation graph
Bisimulation equivalence is decidable for all context-free processes
0 signed · 84 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1101openalex-snapshot
Undecidable Equivalences for Basic Process Algebra
inferredcites →https://doi.org/10.1006/inco.1995.1039openalex-snapshot
On Deciding Readiness and Failure Equivalences for Processes
inferredcites →https://doi.org/10.1007/3-540-16078-7_63openalex-snapshot
Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples
inferredcites →https://doi.org/10.1007/3-540-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/bfb0013021openalex-snapshot
Process theory based on bisimulation semantics
inferredcites →https://doi.org/10.1007/bfb0084787openalex-snapshot
Model checking for context-free processes
inferredcites →https://doi.org/10.1007/bfb0084789openalex-snapshot
Distributed bisimularity is decidable for a class of infinite state-space systems
inferredcites →https://doi.org/10.1016/0020-0190(92)90142-iopenalex-snapshot
A short proof of the decidability of bisimulation for normed bpa-processes
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
inferredcites →https://doi.org/10.1016/0169-7552(94)00016-mopenalex-snapshot
On communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(85)90087-8openalex-snapshot
The theory of ends, pushdown automata, and second-order logic
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1051/ita/1990240403391openalex-snapshot
Graphes canoniques de graphes algébriques
inferredcites →https://doi.org/10.1109/lics.1991.151661openalex-snapshot
Actions speak louder than words: proving bisimilarity for context-free processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1996.0083openalex-snapshot
Undecidable Verification Problems for Programs with Unreliable Channels
inferred← citeshttps://doi.org/10.1006/inco.1999.2843openalex-snapshot
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_3openalex-snapshot
Equivalence-Checking with Infinite-State Systems: Techniques and Results
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_53openalex-snapshot
Effective Lossy Queue Languages
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_5openalex-snapshot
Techniques for Decidability and Undecidability of Bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_33openalex-snapshot
Approximating Weak Bisimulation on Basic Process Algebras
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_11openalex-snapshot
Bisimulation equivalence is decidable for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_173openalex-snapshot
Decidability questions for bisimilarity of Petri nets and some related problems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_48openalex-snapshot
Verification of context-free timed systems using linear hybrid observers
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_56openalex-snapshot
Deciding properties of integral relational automata
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_52openalex-snapshot
On the decidability of process equivalences for the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_39openalex-snapshot
Verifying safety properties of a class of infinite-state distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_62openalex-snapshot
On the model checking problem for branching time logics and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_25openalex-snapshot
Decidability of simulation and bisimulation between lossy channel systems and finite state systems
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_148openalex-snapshot
An elementary bisimulation decision procedure for arbitrary context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_54openalex-snapshot
Petri nets, commutative context-free grammars, and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_4openalex-snapshot
Decidability results in automata and process theory
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_127openalex-snapshot
Regularity for a large class of context-free processes is decidable
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_129openalex-snapshot
Semi-groups acting on context-free graphs
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_152openalex-snapshot
Deciding finiteness of Petri nets up to bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_59openalex-snapshot
Bisimulation collapse and the process taxonomy
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_42openalex-snapshot
Regularity is decidable for normed PA processes in polynomial time
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_15openalex-snapshot
Tableau methods to decide Strong Bisimilarity on LOTOS processes involving pure interleaving and enabling
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_16openalex-snapshot
An Improved Search Strategy for Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_9openalex-snapshot
Definability with the State Operator in Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_3openalex-snapshot
On the Decidability of Non-Interleaving Process Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_4openalex-snapshot
Regularity of BPA-Systems is Decidable
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_5openalex-snapshot
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_8openalex-snapshot
Verification of Nonregular Temporal Properties for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_9openalex-snapshot
Pushdown Processes: Parallel Composition and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-75221-9_22openalex-snapshot
Expansive-Bisimulation for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_11openalex-snapshot
A Context-Free Process as a Pushdown Automaton
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_30openalex-snapshot
Deciding Bisimilarity of Full BPA Processes Locally
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_42openalex-snapshot
Coinductive Proof Techniques for Language Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_23openalex-snapshot
Checking Equality and Regularity for Normed BPA with Silent Moves
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_31openalex-snapshot
Branching Bisimilarity Checking for PRS
inferred← citeshttps://doi.org/10.1007/bfb0014997openalex-snapshot
A fast algorithm for deciding bisimilarity of normed context-free processes
inferred← citeshttps://doi.org/10.1007/bfb0037420openalex-snapshot
Regularity is decidable for normed BPA and normed BPP processes in polynomial time
inferred← citeshttps://doi.org/10.1007/bfb0055627openalex-snapshot
Simulation is decidable for one-counter nets
inferred← citeshttps://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferred← citeshttps://doi.org/10.1007/s12204-014-1555-xopenalex-snapshot
A polynomial time algorithm for checking regularity of totally normed process algebra
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00037-wopenalex-snapshot
Undecidability of bisimilarity for Petri nets and some related problems
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00064-xopenalex-snapshot
A polynomial algorithm for deciding bisimilarity of normed context-free processes
inferred← citeshttps://doi.org/10.1016/b978-008044485-7/50218-9openalex-snapshot
Efficient On-Line Failure Identification for Discrete-Event Systems11This research was supported by National ICT Australia (NICTA) in the framework of the SuperCom project (Model-Based Supervision of Composite Systems). NICTA is funded through the Australian Government’s Backing Australia’s…
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.065openalex-snapshot
Decidability of Weak Bisimilarity for a Subset of BPA
inferred← citeshttps://doi.org/10.1016/j.ic.2015.11.009openalex-snapshot
Proving language inclusion and equivalence by coinduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00290-5openalex-snapshot
Basic process algebra with deadlocking states
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00325-8openalex-snapshot
On the decidability of process equivalences for the π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80531-0openalex-snapshot
Modifications of Expansion Trees for Weak Bisimulation in BPA
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80246-4openalex-snapshot
A Taxonomy of Infinite State Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80259-2openalex-snapshot
Hardness results for weak bisimilarity of simple process algebras
inferred← citeshttps://doi.org/10.1017/s0960129500000992openalex-snapshot
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
inferred← citeshttps://doi.org/10.1017/s1471068406002651openalex-snapshot
Equivalence-checking on infinite-state systems: Techniques and results
inferred← citeshttps://doi.org/10.1109/lics.1993.287569openalex-snapshot
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
inferred← citeshttps://doi.org/10.1109/lics.2015.26openalex-snapshot
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365729openalex-snapshot
A polynomial-time algorithm for deciding equivalence of normed context-free processes
inferred← citeshttps://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
inferred← citeshttps://doi.org/10.1145/199448.199470openalex-snapshot
Verifying infinite state processes with sequential and parallel composition
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:17)2017openalex-snapshot
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid
inferred← citeshttps://doi.org/10.3182/20060829-4-cn-2909.00216openalex-snapshot
EFFICIENT ON-LINE FAILURE IDENTIFICATION FOR DISCRETE-EVENT SYSTEMS 1
inferred← citeshttps://doi.org/10.6100/ir643995openalex-snapshot
Improved verification methods for concurrent systems
inferred← citeshttps://doi.org/10.7146/brics.v7i16.20143openalex-snapshot
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
inferred← citeshttps://doi.org/10.7146/brics.v9i16.21734openalex-snapshot
Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds
inferred← citeshttps://doi.org/10.7146/dpb.v21i417.6730openalex-snapshot
Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)
inferred← citeshttps://doi.org/10.7146/dpb.v22i457.6930openalex-snapshot
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.