On the public citation graph

Deciding bisimulation equivalences for a class of non-finite-state programs

https://doi.org/10.1007/bfb0029004
0 signed · 33 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.1993.1069openalex-snapshot
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-18088-5_11openalex-snapshot
Verifying a protocol using relativized bisimulation
inferredcites →https://doi.org/10.1007/bfb0029004openalex-snapshot
Deciding bisimulation equivalences for a class of non-finite-state programs
inferredcites →https://doi.org/10.1016/0167-6423(85)90002-4openalex-snapshot
Algebraic specification and verification of communication protocols
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/0376-5075(78)90014-4openalex-snapshot
Verification of protocols using symbolic execution
inferredcites →https://doi.org/10.1109/tcom.1982.1095558openalex-snapshot
Verification of HDLC
inferredcites →https://doi.org/10.1145/322003.322016openalex-snapshot
Even Simple Programs Are Hard To Analyze
inferredcites →https://doi.org/10.1145/512644.512661openalex-snapshot
Expressing interesting properties of programs in propositional temporal logic
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1145/73560.73580openalex-snapshot
Bisimulation can't be traced
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/800221.806725openalex-snapshot
A formal description of the UNIX operating system
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra

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-52148-8_3openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_27openalex-snapshot
Algebraic theories for name-passing calculi
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_78openalex-snapshot
Undecidable verification problems for programs with unreliable channels
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_58openalex-snapshot
ESP-MC: An experiment in the use of verification tools
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_47openalex-snapshot
Symbolic transition graph with assignment
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_17openalex-snapshot
Time-Action Alternating Model for Timed LOTOS and its Symbolic Verification of Bisimulation Equivalence
inferred← citeshttps://doi.org/10.1007/978-0-387-35394-4_14openalex-snapshot
“On-the-Fly Instantiation” of Value-Passing Processes
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_9openalex-snapshot
Verification of Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_14openalex-snapshot
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption
inferred← citeshttps://doi.org/10.1007/bf01384499openalex-snapshot
Generality in design and compositional verification usingTav
inferred← citeshttps://doi.org/10.1007/bf01887209openalex-snapshot
Automated analysis of mutual exclusion algorithms using CCS
inferred← citeshttps://doi.org/10.1109/cmpass.1994.318461openalex-snapshot
State minimization for concurrent system analysis based on state space exploration
inferred← citeshttps://doi.org/10.1109/lics.1993.287591openalex-snapshot
Verifying programs with unreliable channels
inferred← citeshttps://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench
showing the first 14 of 15 · page through all 15
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.