On the public citation graph

Partial order semantics and read arcs

https://doi.org/10.1007/bfb0029994
0 signed · 34 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.1006/inco.1995.1130openalex-snapshot
Timed Testing of Concurrent Systems
inferredcites →https://doi.org/10.1006/inco.1995.1153openalex-snapshot
Semantics of Inhibitor Nets
inferredcites →https://doi.org/10.1007/3-540-55767-9openalex-snapshot
Modular Construction and Partial Order Semantics of Petri Nets
inferredcites →https://doi.org/10.1007/3-540-56863-8_47openalex-snapshot
Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs
inferredcites →https://doi.org/10.1007/3-540-57529-4_68openalex-snapshot
Order structures and generalisations of Szpilrajn's theorem
inferredcites →https://doi.org/10.1007/3-540-60218-6_11openalex-snapshot
A Petri net semantics for π-calculus
inferredcites →https://doi.org/10.1007/3-540-61363-3_7openalex-snapshot
Non sequential semantics for contextual P/T nets
inferredcites →https://doi.org/10.1007/3-540-63165-8_209openalex-snapshot
Efficiency of asynchronous systems and read arcs in petri nets
inferredcites →https://doi.org/10.1007/bf01178907openalex-snapshot
Contextual nets
inferredcites →https://doi.org/10.1016/0012-365x(85)90042-1openalex-snapshot
Interval graphs and interval orders

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11767589_19openalex-snapshot
On the Step Explosion Problem
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_16openalex-snapshot
Process Semantics of P/T-Nets with Inhibitor Arcs
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_15openalex-snapshot
Algebraic Models for Contextual Nets
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_13openalex-snapshot
Two Algebraic Process Semantics for Contextual Nets
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_35openalex-snapshot
Causality Semantics of Petri Nets with Weighted Inhibitor Arcs
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_13openalex-snapshot
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations*
inferred← citeshttps://doi.org/10.1007/978-3-540-30232-2_20openalex-snapshot
Petri Net Semantics of the Finite π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_8openalex-snapshot
A Generalisation of a Relational Structures Model of Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_17openalex-snapshot
History Preserving Bisimulation for Contextual Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_21openalex-snapshot
Algebraic Theories for Contextual Pre-nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_13openalex-snapshot
Complete Process Semantics for Inhibitor Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_18openalex-snapshot
Synthesis of Elementary Net Systems with Context Arcs and Localities
inferred← citeshttps://doi.org/10.1007/bfb0029943openalex-snapshot
Mathematical Foundations of Computer Science 1997
inferred← citeshttps://doi.org/10.1007/bfb0053542openalex-snapshot
An event structure semantics for P/T contextual nets: Asymmetric event structures
inferred← citeshttps://doi.org/10.1007/bfb0055062openalex-snapshot
Axioms for contextual net processes
inferred← citeshttps://doi.org/10.1007/bfb0055644openalex-snapshot
Unfolding and finite prefix for nets with read arcs
inferred← citeshttps://doi.org/10.1007/s00236-008-0071-6openalex-snapshot
Relational structures model of concurrency
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00127-xopenalex-snapshot
Analysis issues in Petri nets with inhibitor arcs
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.1016/s1571-0661(04)80949-6openalex-snapshot
Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
inferred← citeshttps://doi.org/10.1109/ecbs.2005.53openalex-snapshot
Model Checking Embedded Systems with PROMELA
inferred← citeshttps://doi.org/10.1109/etfa.1999.815367openalex-snapshot
Simultaneity in signal-event systems
inferred← citeshttps://doi.org/10.1109/icnc.2015.7377979openalex-snapshot
Conversion and verification of recursive structure in PI-calculus with compositional petri-NET
inferred← citeshttps://doi.org/10.1109/icpads.2016.0073openalex-snapshot
Checking the Inconsistent Data in Concurrent Systems by Petri Nets with Data Operations
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.