On the public citation graph
Behavioural notions for elementary net systems
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-13345-3_37openalex-snapshot
Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness
inferredcites →https://doi.org/10.1007/3-540-19488-6_147openalex-snapshot
Some behavioural aspects of net theory
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-3-540-47919-2_4openalex-snapshot
Behaviour of Elementary Net 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(87)90090-9openalex-snapshot
Sequential and concurrent behaviour in Petri net theory
inferredcites →https://doi.org/10.1016/0304-3975(90)90193-lopenalex-snapshot
Some behavioural aspects of net theory
inferredcites →https://doi.org/10.1016/0304-3975(91)90087-iopenalex-snapshot
Event structures and trace monoids
inferredcites →https://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks
inferredcites →https://doi.org/10.25596/jalc-2019-003openalex-snapshot
The k-Dimensional Cube is k-Representable
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations
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.1995.1032openalex-snapshot
A Trace Semantics for Petri Nets
inferred← citeshttps://doi.org/10.1006/inco.1995.1062openalex-snapshot
Transition-Systems, Event Structures, and Unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_31openalex-snapshot
Pomsets for Local Trace Languages
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-49019-1_16openalex-snapshot
Model Checking Logics for Communicating Sequential Agents
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_43openalex-snapshot
Design methods based on nets
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_81openalex-snapshot
Extending temporal logic by explicit concurrency
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_97openalex-snapshot
Invariant semantics of nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_166openalex-snapshot
Esprit basic research action 3148 DEMON (Design methods based on nets) — Aims, scope and achievements —
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_107openalex-snapshot
A trace semantics for Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_66openalex-snapshot
Complexity results for 1-safe nets
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_3openalex-snapshot
On the model of computation of place/transition Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_136openalex-snapshot
Deriving histories of nets with priority relation
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_46openalex-snapshot
Fault detection in telecommunication networks based on a Petri net representation of alarm propagation
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_23openalex-snapshot
Petri nets and other models of concurrency
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_18openalex-snapshot
A Local Presentation of Synchronizing Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_12openalex-snapshot
On Interval Semantics of Inhibitor and Activator Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-26651-5_4openalex-snapshot
Extended Future in Testing Semantics for Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_4openalex-snapshot
On Interval Process Semantics of Petri Nets with Inhibitor Arcs
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_13openalex-snapshot
Modeling Operational Semantics with Interval Orders Represented by Sequences of Antichains
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-642-15928-2_1openalex-snapshot
A False History of True Concurrency: From Petri to Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_13openalex-snapshot
A False History of True Concurrency: From Petri to Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_30openalex-snapshot
Modeling Interval Order Structures with Partially Commutative Monoids
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_3openalex-snapshot
Semantics of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bf02811341openalex-snapshot
Models and logics for true concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90193-lopenalex-snapshot
Some behavioural aspects of net theory
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90180-nopenalex-snapshot
Elementary transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90181-eopenalex-snapshot
A logical characterization of well branching event structures
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00231-7openalex-snapshot
Complexity results for 1-safe nets
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00121-2openalex-snapshot
Process versus unfolding semantics for Place/Transition Petri nets
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50047-3openalex-snapshot
Process Algebra Traces Augmented with Causal Relationships
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50049-7openalex-snapshot
A LOTOS Based Calculus with True Concurrency Semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2016.12.009openalex-snapshot
Modeling concurrency with interval traces
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.003openalex-snapshot
Interval semantics for Petri nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00597-2openalex-snapshot
Clustering for Petri nets
inferred← citeshttps://doi.org/10.1017/s0960129597002314openalex-snapshot
On the semantics of place/transition Petri nets
inferred← citeshttps://doi.org/10.1134/s0361768808030018openalex-snapshot
Semantic domains of timed event structures
inferred← citeshttps://doi.org/10.1134/s0361768815030020openalex-snapshot
Comparative trace semantics of time Petri nets
inferred← citeshttps://doi.org/10.1134/s0361768820040040openalex-snapshot
Testing Equivalences of Time Petri Nets
inferred← citeshttps://doi.org/10.3390/math11010047openalex-snapshot
The Unfolding: Origins, Techniques, and Applications within Discrete Event Systems
inferred← citeshttps://doi.org/10.7146/dpb.v20i353.6583openalex-snapshot
Transition Systems, Event Structures and Unfoldings
inferred← citeshttps://doi.org/10.7146/dpb.v22i455.6773openalex-snapshot
Complexity Results for 1-safe Nets
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.