On the public citation graph

Deciding bisimulation-like equivalences with finite-state processes

https://doi.org/10.1007/bfb0055053
0 signed · 45 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.1028openalex-snapshot
Characteristic Formulas for Processes with Divergence
inferredcites →https://doi.org/10.1006/inco.1995.1129openalex-snapshot
Bisimulation Equivalence Is Decidable for All Context-Free Processes
inferredcites →https://doi.org/10.1006/inco.1999.2826openalex-snapshot
Process Rewrite Systems
inferredcites →https://doi.org/10.1007/3-540-57208-2_11openalex-snapshot
Bisimulation equivalence is decidable for basic parallel processes
inferredcites →https://doi.org/10.1007/3-540-60218-6_26openalex-snapshot
Checking regular properties of Petri nets
inferredcites →https://doi.org/10.1007/3-540-60249-6_54openalex-snapshot
Petri nets, commutative context-free grammars, and basic parallel processes
inferredcites →https://doi.org/10.1007/3-540-61440-0_152openalex-snapshot
Deciding finiteness of Petri nets up to bisimulation
inferredcites →https://doi.org/10.1007/3-540-61604-7_56openalex-snapshot
Infinite results
inferredcites →https://doi.org/10.1007/3-540-61604-7_57openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown processes
inferredcites →https://doi.org/10.1007/3-540-62034-6_40openalex-snapshot
Weak bisimulation and model checking for Basic Parallel Processes
inferredcites →https://doi.org/10.1007/3-540-63141-0_21openalex-snapshot
How to Parallelize sequential processes
inferredcites →https://doi.org/10.1007/3-540-63141-0_23openalex-snapshot
Model checking PA-processes
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0055053openalex-snapshot
Deciding bisimulation-like equivalences with finite-state processes
inferredcites →https://doi.org/10.1016/0020-0190(76)90073-9openalex-snapshot
Information Processing Letters
inferredcites →https://doi.org/10.1016/0304-3975(95)00037-wopenalex-snapshot
Undecidability of bisimilarity for Petri nets and some related problems
inferredcites →https://doi.org/10.1016/s1571-0661(05)80428-1openalex-snapshot
Bisimilarity of processes with finite-state systems
inferredcites →https://doi.org/10.1016/s1571-0661(05)80675-9openalex-snapshot
Bisimilarity is decidable in the union of normed BPA and normed BPP processes
inferredcites →https://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.1145/333623.333624openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown 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-44464-5_11openalex-snapshot
On Simulation-Checking with Sequential Systems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_19openalex-snapshot
On the Power of Labels in Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_33openalex-snapshot
On the Complexity of Bisimulation Problems for Pushdown Automata
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_28openalex-snapshot
Efficient Verification Algorithms for One-Counter Processes
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_29openalex-snapshot
On the Complexity of Bisimulation Problems for Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_25openalex-snapshot
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_26openalex-snapshot
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
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-48523-6_47openalex-snapshot
Simulation Preorder on Simple Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-58666-9_8openalex-snapshot
A Framework for Estimating Simplicity of Automatically Discovered Process Models Based on Structural and Behavioral Characteristics
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_16openalex-snapshot
Branching-Time Model Checking Gap-Order Constraint Systems
inferred← citeshttps://doi.org/10.1007/bfb0055615openalex-snapshot
The regular viewpoint on PA-processes
inferred← citeshttps://doi.org/10.1007/s00236-020-00376-5openalex-snapshot
Characteristic invariants in Hennessy–Milner logic
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00125-8openalex-snapshot
Regularity of normed PA processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00101-8openalex-snapshot
Decidability of model checking with the temporal logic EF
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00094-9openalex-snapshot
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80257-9openalex-snapshot
Derivation of Characteristic Formulae
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82505-8openalex-snapshot
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
inferred← citeshttps://doi.org/10.1017/s0960129503003992openalex-snapshot
Complexity of weak bisimilarity and regularity for BPA and BPP
inferred← citeshttps://doi.org/10.7146/brics.v5i6.19278openalex-snapshot
Further Results on Partial Order Equivalences on Infinite 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.v8i19.21680openalex-snapshot
On the Power of Labels in Transition Systems
showing the first 23 of 24 · page through all 24
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.