On the public citation graph

Distributed bisimularity is decidable for a class of infinite state-space systems

https://doi.org/10.1007/bfb0084789
0 signed · 20 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.
Claim with ORCID
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.
See reference health

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-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/3-540-55179-4_2openalex-snapshot
Silence is golden: Branching bisimilarity is decidable for context-free processes
inferredcites →https://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1016/0890-5401(89)90070-9openalex-snapshot
A complete axiomatisation for observational congruence of finite-state behaviours
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.1007/3-540-57208-2_11openalex-snapshot
Bisimulation equivalence is decidable for 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/978-1-4471-2120-6_9openalex-snapshot
Definability with the State Operator in Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_46openalex-snapshot
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-38697-8_5openalex-snapshot
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_19openalex-snapshot
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities
inferred← citeshttps://doi.org/10.1007/bfb0084788openalex-snapshot
Bisimulation equivalence is decidable for all context-free processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80297-xopenalex-snapshot
Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP
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.3233/fi-2015-1170openalex-snapshot
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
inferred← citeshttps://doi.org/10.3233/fi-2016-1318openalex-snapshot
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities
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.