On the public citation graph

On automatically explaining bisimulation inequivalence

https://doi.org/10.1007/bfb0023750
0 signed · 46 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.1007/3-540-52148-8_2openalex-snapshot
Testing equivalence as a bisimulation equivalence
inferredcites →https://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
inferredcites →https://doi.org/10.1007/978-1-4471-3534-0_7openalex-snapshot
Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot
Bisimulation through probabilistic testing
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench
inferredcites →https://doi.org/10.1145/200836.200876openalex-snapshot
Bisimulation can't be traced
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/73560.73580openalex-snapshot
Bisimulation can't be traced
inferredcites →https://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)
inferredcites →https://doi.org/10.1145/800221.806724openalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential 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.2001.2962openalex-snapshot
Bisimulation for Labelled Markov Processes
inferred← citeshttps://doi.org/10.1007/11419822_5openalex-snapshot
A Methodology Based on Formal Methods for Predicting the Impact of Dynamic Power Management
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_18openalex-snapshot
Efficient Diagnostic Generation for Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_87openalex-snapshot
The NCSU Concurrency Workbench
inferred← citeshttps://doi.org/10.1007/978-3-030-57201-3_8openalex-snapshot
Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_4openalex-snapshot
Fixpoint Theory – Upside Down
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_1openalex-snapshot
A Game for Linear-time–Branching-time Spectroscopy
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_13openalex-snapshot
Equivalence Checking 40 Years After: A Review of Bisimulation Tools
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_12openalex-snapshot
Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-319-10172-9_17openalex-snapshot
Behavioral Comparison of Process Models Based on Canonically Reduced Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_32openalex-snapshot
Process Algebra and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-85758-7_20openalex-snapshot
Diagnosing Differences between Business Process Models
inferred← citeshttps://doi.org/10.1007/978-3-642-38230-7_5openalex-snapshot
Event Structures as a Foundation for Process Model Differencing, Part 1: Acyclic processes
inferred← citeshttps://doi.org/10.1007/bf01384080openalex-snapshot
Verification in process algebra of the distributed control of track vehicles?A case study
inferred← citeshttps://doi.org/10.1007/s00165-012-0242-7openalex-snapshot
Exploring probabilistic bisimulations, part I
inferred← citeshttps://doi.org/10.1007/s004460050010openalex-snapshot
Generating diagnostic information for behavioral preorders
inferred← citeshttps://doi.org/10.1016/j.is.2015.09.009openalex-snapshot
Diagnosing behavioral differences between business process models: An approach based on event structures
inferred← citeshttps://doi.org/10.1016/j.scico.2013.02.009openalex-snapshot
Compositional reasoning for weighted Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.003openalex-snapshot
Constructive logical characterizations of bisimilarity for reactive probabilistic systems
inferred← citeshttps://doi.org/10.1109/lics.1998.705681openalex-snapshot
A logical characterization of bisimulation for labeled Markov processes
inferred← citeshttps://doi.org/10.1109/tnsm.2018.2883362openalex-snapshot
Measuring Business Process Consistency Across Different Abstraction Levels
inferred← citeshttps://doi.org/10.1142/p595openalex-snapshot
Labelled Markov Processes
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cbbopenalex-snapshot
Fixpoint Theory - Upside Down
inferred← citeshttps://doi.org/10.3166/tsi.22.461-495openalex-snapshot
Logiques temporelles basées sur actions pour la vérification des systèmes asynchrones
inferred← citeshttps://doi.org/10.4204/eptcs.255.3openalex-snapshot
Bisimulation and Hennessy-Milner Logic for Generalized Synchronization Trees
inferred← citeshttps://doi.org/10.4204/eptcs.390.5openalex-snapshot
Modal Logic Characterizations of Forward, Reverse, and Forward-Reverse Bisimilarities
inferred← citeshttps://doi.org/10.4230/lipics.concur.2021.32openalex-snapshot
Explaining Behavioural Inequivalence Generically in Quasilinear Time
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:19)2022openalex-snapshot
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy
inferred← citeshttps://doi.org/10.46298/lmcs-18(4:6)2022openalex-snapshot
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:15)2023openalex-snapshot
Fixpoint Theory -- Upside Down
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.