On the public citation graph

Deadlock analysis in networks of communicating processes

https://doi.org/10.1007/bf01784721
0 signed · 50 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-12896-4_351openalex-snapshot
A static analysis of CSP programs
inferredcites →https://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/3-540-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/978-3-642-82453-1openalex-snapshot
Logics and Models of Concurrent Systems
inferredcites →https://doi.org/10.1007/bf00264434openalex-snapshot
Deterministic buffer synchronization of sequential processes
inferredcites →https://doi.org/10.1016/0020-0190(79)90065-6openalex-snapshot
Deadlock absence proofs for networks of communicating processes
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0890-5401(87)90004-6openalex-snapshot
The pursuit of deadlock freedom
inferredcites →https://doi.org/10.1016/0890-5401(89)90026-6openalex-snapshot
Reasoning about networks with many identical finite state processes
inferredcites →https://doi.org/10.1145/322123.322134openalex-snapshot
Concurrent Processes and Their Syntax
inferredcites →https://doi.org/10.1145/356603.356607openalex-snapshot
Some Deadlock Properties of Computer Systems
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/72981.72998openalex-snapshot
A structural induction theorem for processes
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.26153/tsw/56288openalex-snapshot
Invariance and nondeterminacy

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-56939-1_108openalex-snapshot
Efficient analysis of concurrent constraint logic programs
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_22openalex-snapshot
An efficient technique for deadlock analysis of large scale process networks
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_3openalex-snapshot
Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_5openalex-snapshot
A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-33693-0_22openalex-snapshot
Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_2openalex-snapshot
A Semantics for Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_5openalex-snapshot
Analyzing Component-Based Systems on the Basis of Architectural Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_12openalex-snapshot
An Abstract Framework for Deadlock Prevention in BIP
inferred← citeshttps://doi.org/10.1007/bf02745366openalex-snapshot
Logical models of discrete event systems: A comparative exposition
inferred← citeshttps://doi.org/10.1007/bfb0053592openalex-snapshot
Model-checking CSP-Z
inferred← citeshttps://doi.org/10.1007/s00165-005-0071-zopenalex-snapshot
Concurrent software verification with states, events, and deadlocks
inferred← citeshttps://doi.org/10.1007/s00165-019-00483-2openalex-snapshot
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
inferred← citeshttps://doi.org/10.1007/s00165-019-00487-yopenalex-snapshot
Discovering and correcting a deadlock in a channel implementation
inferred← citeshttps://doi.org/10.1007/s10009-022-00650-6openalex-snapshot
Approximate verification of concurrent systems using token structures and invariants
inferred← citeshttps://doi.org/10.1007/s10703-012-0160-6openalex-snapshot
Deadlock-freedom in component systems with architectural constraints
inferred← citeshttps://doi.org/10.1007/s11227-014-1357-9openalex-snapshot
On-the-fly adaptive routing for dragonfly interconnection networks
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.05.012openalex-snapshot
Reachability in Tree-Like Component Systems is PSPACE-Complete
inferred← citeshttps://doi.org/10.1016/j.scico.2013.02.006openalex-snapshot
Efficient deadlock analysis of component-based software architectures
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.034openalex-snapshot
A semantics for concurrent separation logic
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00023-xopenalex-snapshot
Model-checking CSP-Z: strategy, tool support and industrial application
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00013-1openalex-snapshot
A confluent semantic basis for the analysis of concurrent constraint logic programs
inferred← citeshttps://doi.org/10.1109/fmcad.2006.8openalex-snapshot
Assume-Guarantee Reasoning for Deadlock
inferred← citeshttps://doi.org/10.1109/icpp.2012.46openalex-snapshot
On-the-Fly Adaptive Routing in High-Radix Hierarchical Networks
inferred← citeshttps://doi.org/10.1109/icpp.2013.72openalex-snapshot
Efficient Routing Mechanisms for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/memcod.2004.1459856openalex-snapshot
Automated, compositional and iterative deadlock detection
inferred← citeshttps://doi.org/10.1109/tase.2009.18openalex-snapshot
Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation
inferred← citeshttps://doi.org/10.1145/3152910openalex-snapshot
Global and Local Deadlock Freedom in BIP
inferred← citeshttps://doi.org/10.1145/3335149openalex-snapshot
Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving
inferred← citeshttps://doi.org/10.1145/3477355.3477365openalex-snapshot
CSP: A Practical Process Algebra
inferred← citeshttps://doi.org/10.21236/ada548741openalex-snapshot
Checking for Circular Dependencies in Distributed Stream Programs
inferred← citeshttps://doi.org/10.4204/eptcs.138.1openalex-snapshot
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
inferred← citeshttps://doi.org/10.5220/0006002901230130openalex-snapshot
Towards an ASM-based Characterization of the Deadlock-freedom Property
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.