On the public citation graph

Modeling concurrency by partial orders and nonlinear transition systems

https://doi.org/10.1007/bfb0013031
0 signed · 32 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-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/3-540-15204-0_20openalex-snapshot
Semantics of concurrent systems: A modular fixed-point trace approach
inferredcites →https://doi.org/10.1007/3-540-16047-7openalex-snapshot
The Analysis of Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-642-69968-9openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bfb0027048openalex-snapshot
Petri nets: Basic notions, structure, behaviour
inferredcites →https://doi.org/10.1007/bfb0030293openalex-snapshot
Traces, histories, graphs: Instances of a process monoid
inferredcites →https://doi.org/10.1016/0012-365x(85)90042-1openalex-snapshot
Interval graphs and interval orders
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(88)90051-5openalex-snapshot
Theory of traces
inferredcites →https://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks
inferredcites →https://doi.org/10.1145/5383.5384openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.3233/fi-1981-4210openalex-snapshot
On Partial Languages

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-45694-5_3openalex-snapshot
Event-State Duality: The Enriched Case
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_2openalex-snapshot
Metric pomset semantics for a concurrent language with recursion
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_96openalex-snapshot
Action systems and action refinement in the development of parallel systems
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_32openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_42openalex-snapshot
On the nature of events
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_20openalex-snapshot
Timed Process Algebra, Petri Nets, and Event Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_16openalex-snapshot
Defining Conditional Independence Using Collapses
inferred← citeshttps://doi.org/10.1007/978-3-030-22397-7_1openalex-snapshot
Representing Dependencies in Event Structures
inferred← citeshttps://doi.org/10.1007/bf00871720openalex-snapshot
On system executions and states
inferred← citeshttps://doi.org/10.1007/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferred← citeshttps://doi.org/10.1007/bf02577738openalex-snapshot
Using true concurrency to model execution of parallel programs
inferred← citeshttps://doi.org/10.1007/bfb0018343openalex-snapshot
Temporal Structures
inferred← citeshttps://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferred← citeshttps://doi.org/10.1007/s002360100070openalex-snapshot
Process algebra with action dependencies
inferred← citeshttps://doi.org/10.1007/s004460050062openalex-snapshot
Proving refinement using transduction
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00174-hopenalex-snapshot
On the nature of events: another perspective in concurrency
inferred← citeshttps://doi.org/10.1109/icpp.1993.35openalex-snapshot
A Unified Model for Concurrent Debugging
inferred← citeshttps://doi.org/10.23638/lmcs-16(2:3)2020openalex-snapshot
Representing Dependencies in Event Structures
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.