On the public citation graph

Axioms for contextual net processes

https://doi.org/10.1007/bfb0055062
0 signed · 46 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.1153openalex-snapshot
Semantics of Inhibitor 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-57787-4_18openalex-snapshot
Contextual occurrence nets and concurrent constraint programming
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-61604-7_64openalex-snapshot
Rewriting logic as a semantic framework for concurrency: a progress report
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/3-540-64299-4_36openalex-snapshot
An inductive view of graph transformation
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-642-69968-9openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1007/bf01178506openalex-snapshot
Concurrent bisimulations in Petri nets
inferredcites →https://doi.org/10.1007/bf01178907openalex-snapshot
Contextual nets
inferredcites →https://doi.org/10.1007/bf03036469openalex-snapshot
Axiomatizing the algebra of net computations and processes
inferredcites →https://doi.org/10.1007/bfb0026983openalex-snapshot
A 2-categorical presentation of term graph rewriting
inferredcites →https://doi.org/10.1007/bfb0029994openalex-snapshot
Partial order semantics and read arcs
inferredcites →https://doi.org/10.1007/bfb0053542openalex-snapshot
An event structure semantics for P/T contextual nets: Asymmetric event structures
inferredcites →https://doi.org/10.1016/0022-4049(87)90121-6openalex-snapshot
Cartesian bicategories I
inferredcites →https://doi.org/10.1016/0890-5401(90)90013-8openalex-snapshot
Petri nets are monoids
inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot
The non-sequential behaviour of Petri nets
inferredcites →https://doi.org/10.1016/s0022-4049(96)00012-6openalex-snapshot
Bicategories of processes
inferredcites →https://doi.org/10.1016/s0167-6423(97)00007-5openalex-snapshot
Partial order and contextual net semantics for atomic and locally atomic CC programs
inferredcites →https://doi.org/10.1016/s0304-3975(01)00234-1openalex-snapshot
Partial order semantics and read arcs
inferredcites →https://doi.org/10.1016/s0304-3975(96)00009-6openalex-snapshot
An axiomatization of the algebra of Petri net concatenable processes
inferredcites →https://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
inferredcites →https://doi.org/10.1142/s0129054191000182openalex-snapshot
FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
inferredcites →https://doi.org/10.3233/fi-1988-11404openalex-snapshot
Behavior Structures and Nets
inferredcites →https://doi.org/10.3233/fi-1997-3111openalex-snapshot
Representation of Residuated Semigroups in Some Algebras of Relations (The Method of Canonical Models)
inferredcites →https://doi.org/10.3233/fi-1997-313408openalex-snapshot
A Concurrent Functional Semantics for a Process Algebra Based on Action Systems

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.1006/inco.2001.3060openalex-snapshot
Contextual Petri Nets, Asymmetric Event Structures, and Processes
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-45541-8_6openalex-snapshot
Petri Nets over Partial Algebra
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_3openalex-snapshot
Normal Forms for Partitions and Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-40020-2_8openalex-snapshot
Pre-nets, Read Arcs and Unfolding: A Functorial Presentation
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-79980-1_5openalex-snapshot
Petri Nets Are Dioids
inferred← citeshttps://doi.org/10.1007/s00236-018-0314-0openalex-snapshot
Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00234-1openalex-snapshot
Partial order semantics and read arcs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00318-8openalex-snapshot
Normal forms for algebras of connections
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80937-xopenalex-snapshot
Some algebraic laws for spans (and their connections with multirelations)1 1Research partly supported by the EC TMR Network getgrats and by the Italian MURST Project tosca.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80950-2openalex-snapshot
Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra
inferred← citeshttps://doi.org/10.1017/s0960129504004189openalex-snapshot
Concurrent models for Linda with transactions
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419655openalex-snapshot
Semantics of petri nets: A comparison
inferred← citeshttps://doi.org/10.1142/9789812562494_0057openalex-snapshot
THE ALGEBRAIC STRUCTURE OF PETRI 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.