On the public citation graph

Partial orderings descriptions and observations of nondeterministic concurrent processes

https://doi.org/10.1007/bfb0013030
0 signed · 100 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-15670-4_12openalex-snapshot
Categories of models for concurrency
inferredcites →https://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferredcites →https://doi.org/10.1007/3-540-17906-2_32openalex-snapshot
CCS — and its relationship to net theory
inferredcites →https://doi.org/10.1007/3-540-18086-9openalex-snapshot
Advances in Petri Nets 1987
inferredcites →https://doi.org/10.1007/3-540-18086-9_27openalex-snapshot
Operational Petri net semantics for CCSP
inferredcites →https://doi.org/10.1007/3-540-18419-8openalex-snapshot
Mathematical Models for the Semantics of Parallelism
inferredcites →https://doi.org/10.1007/3-540-18419-8_13openalex-snapshot
CCS is an (augmented) contact free C/E system
inferredcites →https://doi.org/10.1007/3-540-18419-8_9openalex-snapshot
Testing equivalences for event structures
inferredcites →https://doi.org/10.1007/3-540-51486-4_71openalex-snapshot
Equivalence notions for concurrent systems and refinement of actions
inferredcites →https://doi.org/10.1007/978-3-642-69968-9openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1007/bf00264365openalex-snapshot
Extensional equivalences for transition systems
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf02915446openalex-snapshot
A distributed operational semantics for CCS based on condition/event systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0022474openalex-snapshot
Petri nets, event structures and domains
inferredcites →https://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferredcites →https://doi.org/10.1016/0304-3975(80)90004-3openalex-snapshot
Behaviours of concurrent systems
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I
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)90067-7openalex-snapshot
Algèbre de processus et synchronisation
inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot
The non-sequential behaviour of Petri nets
inferredcites →https://doi.org/10.1109/lics.1988.5112openalex-snapshot
On the consistency of 'truly concurrent' operational and denotational semantics
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1999.2825openalex-snapshot
Tile Formats for Located and Mobile Systems
inferred← citeshttps://doi.org/10.1007/10719839_42openalex-snapshot
From Semantics to Spatial Distribution
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_26openalex-snapshot
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_32openalex-snapshot
On Plain and Hereditary History-Preserving Bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_10openalex-snapshot
Causal trees interleaving + causality
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_13openalex-snapshot
Equivalences and refinement
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_8openalex-snapshot
Transition systems with algebraic structure as models of computations
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_53openalex-snapshot
Observational logics and concurrency models
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_19openalex-snapshot
A survey of behaviour and equivalence preserving refinements of petri nets
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_2openalex-snapshot
On causality observed incrementally, finally
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_158openalex-snapshot
Deciding history preserving bisimilarity
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-55610-9_170openalex-snapshot
Maximality preservation and the ST-idea for action refinements
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_109openalex-snapshot
A parametric approach to localities
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_110openalex-snapshot
Proved trees
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_32openalex-snapshot
A categorical view of process refinement
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_46openalex-snapshot
Distributed implementation of CCS
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_10openalex-snapshot
Axiomatising real-timed processes
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_65openalex-snapshot
Distribution and locality of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_77openalex-snapshot
A fully abstract semantics for causality in the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_61openalex-snapshot
Dynamic matrices and the cost analysis of concurrent programs
inferred← citeshttps://doi.org/10.1007/3540539816_56openalex-snapshot
An extended expansion theorem
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_16openalex-snapshot
An Improved Search Strategy for Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_4openalex-snapshot
A Process Calculus with Incomparable Priorities
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_7openalex-snapshot
Observation Trees
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_9openalex-snapshot
Causal Automata I: Confluence ≡ {AND, OR} Causality
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_2openalex-snapshot
Axiomatizing Team Equivalence for Finite-State Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_17openalex-snapshot
Language Representability of Finite P/T Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_3openalex-snapshot
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_9openalex-snapshot
Automata for True Concurrency Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_46openalex-snapshot
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_3openalex-snapshot
On the Decidability of Non-Interleaving Process Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_1openalex-snapshot
Ugo Montanari in a Nutshell
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_24openalex-snapshot
Ugo Montanari and Concurrency Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-77312-2_10openalex-snapshot
Causality in Membrane Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_29openalex-snapshot
Concurrency Can’t Be Observed, Asynchronously
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_2openalex-snapshot
Concurrent Processes and Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_24openalex-snapshot
Local Model Checking in a Logic for True Concurrency
inferred← citeshttps://doi.org/10.1007/bf02811341openalex-snapshot
Models and logics for true concurrency
inferred← citeshttps://doi.org/10.1007/bfb0013019openalex-snapshot
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
inferred← citeshttps://doi.org/10.1007/bfb0023477openalex-snapshot
Minimal transition systems for history-preserving bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0029614openalex-snapshot
Event structures, causal trees, and refinements
inferred← citeshttps://doi.org/10.1007/bfb0084797openalex-snapshot
Posets for configurations!
inferred← citeshttps://doi.org/10.1007/s00236-020-00377-4openalex-snapshot
Team bisimilarity, and its associated modal logic, for BPP nets
inferred← citeshttps://doi.org/10.1007/s002360000041openalex-snapshot
Refinement of actions and equivalence notions for concurrent systems
inferred← citeshttps://doi.org/10.1007/s002360050086openalex-snapshot
Locality based semantics for process algebras
inferred← citeshttps://doi.org/10.1007/s40595-015-0051-zopenalex-snapshot
Language representability of finite place/transition Petri nets
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90010-mopenalex-snapshot
Axiomatizing CCS, nets and processes
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00011-5openalex-snapshot
Petri-net-based deadlock analysis of Process Algebra programs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90052-hopenalex-snapshot
Causal automata
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90157-oopenalex-snapshot
Bisimulation and action refinement
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00205-wopenalex-snapshot
A theory of processes with durational actions
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00219-9openalex-snapshot
Location equivalence in a parametric setting
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50034-5openalex-snapshot
Action Refinement
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.012openalex-snapshot
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
inferred← citeshttps://doi.org/10.1016/j.ic.2003.12.003openalex-snapshot
Models for name-passing processes: interleaving and causal
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.2020.100631openalex-snapshot
Conflict vs causality in event structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00326-1openalex-snapshot
Distributed processes and location failures
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80261-0openalex-snapshot
On Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80297-xopenalex-snapshot
Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80470-0openalex-snapshot
Tiles for Concurrent and Located Calculi
inferred← citeshttps://doi.org/10.1017/s0960129513000108openalex-snapshot
Concurrency cannot be observed, asynchronously
inferred← citeshttps://doi.org/10.1049/ip-sen:20030129openalex-snapshot
View-centric reasoning for Linda and Tuple Space computation
inferred← citeshttps://doi.org/10.1109/32.223807openalex-snapshot
L.0: a truly concurrent executable temporal logic language for protocols
inferred← citeshttps://doi.org/10.1109/ispa/iucc.2017.00094openalex-snapshot
Exploiting Aperiodic Server to Improve Aperiodic Responsiveness for LET-Based Real-Time Systems
inferred← citeshttps://doi.org/10.1109/lics.2000.855781openalex-snapshot
Models for name-passing processes: interleaving and causal
inferred← citeshttps://doi.org/10.1145/2629638openalex-snapshot
A Logic for True Concurrency
inferred← citeshttps://doi.org/10.3233/fi-2021-2039openalex-snapshot
Causal Semantics for BPP Nets with Silent Moves
inferred← citeshttps://doi.org/10.4204/eptcs.300.6openalex-snapshot
Conflict vs Causality in Event Structures
inferred← citeshttps://doi.org/10.4204/eptcs.368.1openalex-snapshot
Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:37)2023openalex-snapshot
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4094openalex-snapshot
A Logic for True Concurrency
inferred← citeshttps://doi.org/10.5281/zenodo.26433openalex-snapshot
Gynandromorphism In Ants.
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.