On the public citation graph

Automated analysis of mutual exclusion algorithms using CCS

https://doi.org/10.1007/bf01887209
0 signed · 75 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
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-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-52148-8_14openalex-snapshot
CCS, liveness, and local model checking in the linear time mu-calculus
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-0openalex-snapshot
Specification and Verification of Concurrent Systems
inferredcites →https://doi.org/10.1007/978-1-4612-4886-6openalex-snapshot
Fairness
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bfb0013022openalex-snapshot
Branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferredcites →https://doi.org/10.1007/bfb0013039openalex-snapshot
Temporal logics for CCS
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
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(87)90036-0openalex-snapshot
Modalities for model checking: branching time logic strikes back
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
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(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot
Additional comments on a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/365153.365167openalex-snapshot
Comments on a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/5383.5385openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.001413openalex-snapshot
Research on Automatic Verification of Finite-State Concurrent Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11817949_10openalex-snapshot
Checking a Mutex Algorithm in a Process Algebra with Fairness
inferred← citeshttps://doi.org/10.1007/3-540-53932-8_41openalex-snapshot
An introduction to modal and temporal logics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_8openalex-snapshot
CTL* and ECTL* as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_15openalex-snapshot
Proof systems for message-passing process algebras
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_4openalex-snapshot
Modal μ-calculus, model checking and Gauß elimination
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_6openalex-snapshot
The Formalization and Analysis of CCR Protocol and Service
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_14openalex-snapshot
Message passing mutex
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_1openalex-snapshot
A General Tableau Technique for Verifying Temporal Properties of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-1-84882-258-0_18openalex-snapshot
Shared-Variable Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_20openalex-snapshot
Time and Fairness in a Process Algebra with Non-blocking Reading
inferred← citeshttps://doi.org/10.1007/978-3-642-04912-5_11openalex-snapshot
Teaching Concurrency: Theory in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_21openalex-snapshot
Intensional and Extensional Characterisation of Global Progress in the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_20openalex-snapshot
Parallel complexity in the design and analysis of concurrent systems
inferred← citeshttps://doi.org/10.1007/bf01213531openalex-snapshot
Proof systems for message-passing process algebras
inferred← citeshttps://doi.org/10.1007/bf03180566openalex-snapshot
Deciding bisimilarity is P -complete
inferred← citeshttps://doi.org/10.1007/bfb0039055openalex-snapshot
Verifying temporal properties of processes
inferred← citeshttps://doi.org/10.1007/bfb0039064openalex-snapshot
An implementation of a translational semantics for an imperative language
inferred← citeshttps://doi.org/10.1007/s00236-009-0092-9openalex-snapshot
Liveness of a mutex algorithm in a fair process algebra
inferred← citeshttps://doi.org/10.1007/s00236-015-0221-6openalex-snapshot
CCS: It’s not fair!
inferred← citeshttps://doi.org/10.1007/s10270-014-0416-2openalex-snapshot
Heuristic search for equivalence checking
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90381-gopenalex-snapshot
Verifying networks of processes that communicate via shared variables
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00019-0openalex-snapshot
Model checking using net unfoldings
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90043-2openalex-snapshot
A note on model checking the modal ν-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00172-fopenalex-snapshot
Symbolic bisimulations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00119-0openalex-snapshot
Trapping mutual exclusion in the box calculus
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50035-7openalex-snapshot
Specification and Validation of a Simple Overtaking Protocol using LOTOS
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105079openalex-snapshot
Modelling mutual exclusion in a process algebra with time-outs
inferred← citeshttps://doi.org/10.1016/j.ins.2007.10.023openalex-snapshot
ACTLW – An action-based computation tree logic with unless operator
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00300-0openalex-snapshot
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
inferred← citeshttps://doi.org/10.1109/cmpass.1996.507877openalex-snapshot
Feasibility of model checking software requirements: a case study
inferred← citeshttps://doi.org/10.1109/cmpeur.1991.257366openalex-snapshot
Verifying networks of processes that synchronize via shared variables
inferred← citeshttps://doi.org/10.1109/eurcon.2003.1248127openalex-snapshot
Verification of mutual exclusion algorithms with SMV system
inferred← citeshttps://doi.org/10.1109/glsv.1995.516041openalex-snapshot
Analyzing and verifying locally clocked circuits with the concurrency workbench
inferred← citeshttps://doi.org/10.1109/hicss.1993.284112openalex-snapshot
Model checking of control-finite CSP programs
inferred← citeshttps://doi.org/10.1109/tsa.2016.22openalex-snapshot
Mutual Exclusion Verification of Peterson's Solution in Isabelle/HOL
inferred← citeshttps://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.1504/ijmtm.2003.003411openalex-snapshot
Qualitative and quantitative specification of interorganisational workflows
inferred← citeshttps://doi.org/10.4204/eptcs.255.2openalex-snapshot
Analysing Mutual Exclusion using Process Algebra with Signals
inferred← citeshttps://doi.org/10.4204/eptcs.54.4openalex-snapshot
Automated Analysis of MUTEX Algorithms with FASE
inferred← citeshttps://doi.org/10.4204/eptcs.64.3openalex-snapshot
Read Operators and their Expressiveness in Process Algebras
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0962openalex-snapshot
Verification of Peterson's Algorithm for Leader Election in a Unidirectional Asynchronous Ring Using NuSMV
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
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.