On the public citation graph

Semantics of Concurrent Computation

https://doi.org/10.1007/bfb0022459
0 signed · 72 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 points at this work

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

inferred← citeshttps://doi.org/10.1006/ijhc.1994.1056openalex-snapshot
Concurrent, object-oriented natural language parsing: the ParseTalk model
inferred← citeshttps://doi.org/10.1007/11561927_5openalex-snapshot
On Conspiracies and Hyperfairness in Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-10001-6_22openalex-snapshot
Elements of general net theory
inferred← citeshttps://doi.org/10.1007/3-540-10001-6_27openalex-snapshot
The relative strength of K-density
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_34openalex-snapshot
On the formal definition of ADA
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_10openalex-snapshot
Fair serializability of iterated transactions using fifo-nets
inferred← citeshttps://doi.org/10.1007/3-540-16047-7_35openalex-snapshot
From state machines to temporal logic: Specification methods for protocol standards
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_48openalex-snapshot
ADA concurrency specified by graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_58openalex-snapshot
Ada-concurrency specified by graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_4openalex-snapshot
Formalizing Timing Diagrams as Causal Dependencies for Verification Purposes
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_9openalex-snapshot
Rewriting Logic as a Unifying Framework for Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_17openalex-snapshot
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
inferred← citeshttps://doi.org/10.1007/978-1-4615-6698-4_22openalex-snapshot
Specifying and Verifying Protocols Represented as Abstract Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_6openalex-snapshot
External Interactions on Hybrid Models of Biological Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-17581-2_12openalex-snapshot
Coalgebraic Semantic Model for the Clock Constraint Specification Language
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_37openalex-snapshot
Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_18openalex-snapshot
Modelling Concurrency with Quotient Monoids
inferred← citeshttps://doi.org/10.1007/978-3-540-77395-5_15openalex-snapshot
Temporal Assertions with Parametrised Propositions
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_6openalex-snapshot
A Brief Overview of Agda – A Functional Language with Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-642-11950-7_9openalex-snapshot
On Deadlocks and Fairness in Self-organizing Resource-Flow Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_34openalex-snapshot
Modal Logic over Higher Dimensional Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_14openalex-snapshot
On the Origin of Events: Branching Cells as Stubborn Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-23391-3_9openalex-snapshot
Requirements Engineering via Non-monotonic Logics and State Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-31128-4_7openalex-snapshot
Abstraction Analysis and Certified Flow and Context Sensitive Points-to Relation for Distributed Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_10openalex-snapshot
From Transitions to Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_5openalex-snapshot
A Concurrent Temporal Programming Model with Atomic Blocks
inferred← citeshttps://doi.org/10.1007/978-3-642-67977-3_9openalex-snapshot
Spezifikation der Synchronisierung Paralleler Rechenprozesse in EPOS
inferred← citeshttps://doi.org/10.1007/978-3-642-69028-0_13openalex-snapshot
Specification and Verification of Networks in a Petri Net based Language
inferred← citeshttps://doi.org/10.1007/978-3-642-69028-0_15openalex-snapshot
A Graph Theoretical Property for Minimal Deadlock
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_10openalex-snapshot
Exponential-Size Model Property for PDL with Separating Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-94-011-1793-7_8openalex-snapshot
On Formalism in Specifications
inferred← citeshttps://doi.org/10.1007/bfb0000595openalex-snapshot
The conceptual task model: a specification technique between requirements engineering and program development (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferred← citeshttps://doi.org/10.1007/bfb0022518openalex-snapshot
Inducing patterns of behaviour in distributed system parts
inferred← citeshttps://doi.org/10.1007/bfb0022544openalex-snapshot
Substitution systems — A family of system models based on concurrency
inferred← citeshttps://doi.org/10.1007/bfb0028798openalex-snapshot
A language theoretic approach to serialization problem in concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0053562openalex-snapshot
Verifiable and executable logic specifications of concurrent objects in $$\mathcal{L}_\pi$$
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90086-8openalex-snapshot
Simulation, reduction and preservation of correctness properties of parallel systems
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90014-9openalex-snapshot
Homomorphisms between models of parallel computation
inferred← citeshttps://doi.org/10.1016/0164-1212(83)90026-2openalex-snapshot
Modeling and projection in software development
inferred← citeshttps://doi.org/10.1016/0164-1212(84)90018-9openalex-snapshot
Environments for VLSI and software engineering
inferred← citeshttps://doi.org/10.1016/0164-1212(85)90019-6openalex-snapshot
Inference from models of software systems
inferred← citeshttps://doi.org/10.1016/0167-6423(85)90016-4openalex-snapshot
Automatic construction of CSP programs from sequential non-deterministic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90049-9openalex-snapshot
Coloured petri nets and the invariant-method
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90014-3openalex-snapshot
An introduction to FIFO nets— monogeneous nets: A subclass of FIFO nets
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90053-1openalex-snapshot
Global serializability of concurrent programs
inferred← citeshttps://doi.org/10.1016/0306-4379(83)90017-0openalex-snapshot
Correctness of a distributed transaction system
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90018-4openalex-snapshot
Verification of resource controller processes
inferred← citeshttps://doi.org/10.1016/b978-0-08-036214-4.50022-1openalex-snapshot
P
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2013.09.001openalex-snapshot
Half a century after Carl Adam Petri’s Ph.D. thesis: A perspective on the field
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.008openalex-snapshot
On Concurrent Games with Payoff
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.009openalex-snapshot
ST-structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.12.007openalex-snapshot
Declarative event based models of concurrency and refinement in psi-calculi
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.001openalex-snapshot
Towards a categorical representation of reversible event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.006openalex-snapshot
A stable non-interleaving early operational semantics for the pi-calculus
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100686openalex-snapshot
Event structure semantics of (controlled) reversible CCS
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.009openalex-snapshot
Synchronous Kleene algebra
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.011openalex-snapshot
Colouring fuzziness for systems biology
inferred← citeshttps://doi.org/10.1080/00207543.2014.942009openalex-snapshot
Investigation of exogenous shocks in complex supply networks – a modular Petri Net approach
inferred← citeshttps://doi.org/10.1080/02522667.1992.10699093openalex-snapshot
Implementation of Deadlock Analysis in Data Flow Graphs
inferred← citeshttps://doi.org/10.1109/ms.1985.229776openalex-snapshot
On Formalism in Specifications
inferred← citeshttps://doi.org/10.1109/tcom.1982.1095452openalex-snapshot
Petri Nets Theory for the Correctness of Protocols
inferred← citeshttps://doi.org/10.1137/0325013openalex-snapshot
Supervisory Control of a Class of Discrete Event Processes
inferred← citeshttps://doi.org/10.1145/1217295.1217298openalex-snapshot
Polychronous design of embedded real-time applications
inferred← citeshttps://doi.org/10.1145/122759.122760openalex-snapshot
Models for performance perturbation analysis
inferred← citeshttps://doi.org/10.1145/3357384.3357882openalex-snapshot
BePT
inferred← citeshttps://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
inferred← citeshttps://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferred← citeshttps://doi.org/10.5555/1769168.1769174openalex-snapshot
Static detection of Livelocks in Ada multitasking programs
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.