On the public citation graph

Processes of place/transition-nets

https://doi.org/10.1007/bfb0036914
0 signed · 50 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-10001-6_26openalex-snapshot
Concurrency
inferredcites →https://doi.org/10.1007/3-540-10001-6_39openalex-snapshot
A dictionary of some basic notions of net theory
inferredcites →https://doi.org/10.1007/3-540-10854-8_39openalex-snapshot
Processes in Petri nets
inferredcites →https://doi.org/10.1007/978-3-642-69028-0_17openalex-snapshot
Subset Languages of Petri Nets
inferredcites →https://doi.org/10.1007/bfb0012772openalex-snapshot
Some properties of D-continuous causal nets
inferredcites →https://doi.org/10.1007/bfb0022474openalex-snapshot
Petri nets, event structures and domains
inferredcites →https://doi.org/10.1007/bfb0036470openalex-snapshot
Discreteness, K-density and D-continuity of occurrence nets
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(82)90079-2openalex-snapshot
An algebraic description of system behaviours
inferredcites →https://doi.org/10.1016/0304-3975(83)90094-4openalex-snapshot
Subset languages of petri nets part II: Closure properties
inferredcites →https://doi.org/10.1016/0378-4754(82)90066-0openalex-snapshot
Petri Net theory and the modeling of systems
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.3233/fi-1980-3107openalex-snapshot
A theorem on the characteristics of non-sequential processes
inferredcites →https://doi.org/10.3233/fi-1981-4210openalex-snapshot
On Partial Languages
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.1007/11494744_17openalex-snapshot
Can I Execute My Scenario in Your Net?
inferred← citeshttps://doi.org/10.1007/11767589_17openalex-snapshot
Towards Synthesis of Petri Nets from Scenarios
inferred← citeshttps://doi.org/10.1007/11767589_21openalex-snapshot
Can I Execute My Scenario in Your Net? VipTool Tells You!
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_13openalex-snapshot
A new definition of morphism on Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_17openalex-snapshot
On structural properties of generalized processes
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_6openalex-snapshot
Concurrent processes with synchronization: Net and algebraic approach
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_20openalex-snapshot
Firing Partial Orders in a Petri Net
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_22openalex-snapshot
Synthesis and Analysis of Petri Nets from Causal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_16openalex-snapshot
Token Trail Semantics – Modeling Behavior of Petri Nets with Labeled Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_10openalex-snapshot
Conformance Checking for Partially Ordered Event Logs Using Token-Based Replay
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_22openalex-snapshot
MSO Logic and the Partial Order Semantics of Place/Transition-Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-65000-5_2openalex-snapshot
Synthesizing Petri Nets from Hasse Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-96154-5_5openalex-snapshot
Petri’s Understanding of 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-642-02424-5_12openalex-snapshot
Hasse Diagram Generators and Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-02424-5_2openalex-snapshot
Unifying Petri Net Semantics with Token Flows
inferred← citeshttps://doi.org/10.1007/978-3-642-38697-8_18openalex-snapshot
Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_13openalex-snapshot
Causality in Bounded Petri Nets is MSO Definable
inferred← citeshttps://doi.org/10.1007/bfb0016226openalex-snapshot
Petri nets, morphisms and compositionality
inferred← citeshttps://doi.org/10.1007/bfb0017129openalex-snapshot
On models and algebras for concurrent processes
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90304-kopenalex-snapshot
An algebra of concurrent non-deterministic processes
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90032-0openalex-snapshot
Petri nets, algebras, morphisms, and compositionality
inferred← citeshttps://doi.org/10.1016/j.is.2012.07.004openalex-snapshot
Simplifying discovered process models in a controlled manner
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00179-3openalex-snapshot
Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80746-1openalex-snapshot
Relating axiomatic and operational semantics of place/transition nets
inferred← citeshttps://doi.org/10.1109/access.2018.2831219openalex-snapshot
A Process-Profile-Based Method to Measure Consistency of E-Commerce System
inferred← citeshttps://doi.org/10.1109/icacte.2008.106openalex-snapshot
A Kind of Structural Differential Point of S-Graph Based on Betweenness Centrality
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419655openalex-snapshot
Semantics of petri nets: A comparison
inferred← citeshttps://doi.org/10.1145/318242.318520openalex-snapshot
Translation of modified predicate transition nets models of cummunication protocols into simulation programs
inferred← citeshttps://doi.org/10.3233/fi-2015-1172openalex-snapshot
Verification of Scenarios in Petri Nets Using Compact Tokenflows
inferred← citeshttps://doi.org/10.3233/fun-2008-873-404openalex-snapshot
Complete Process Semantics of Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5341openalex-snapshot
Canonizable Partial Order Generators and Regular Slice Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2698openalex-snapshot
Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic
inferred← citeshttps://doi.org/10.5220/0004320500250038openalex-snapshot
Synthesizing Decentralized Components from a Variant of Live Sequence Charts
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.