On the public citation graph
Closure properties of deterministic Petri nets
0 signed · 38 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-18086-9_28openalex-snapshot
Infinitary languages of Petri nets and logical sentences
inferredcites →https://doi.org/10.1007/978-3-642-68353-4_34openalex-snapshot
Deterministic Languages of Petri Nets
inferredcites →https://doi.org/10.1007/978-3-642-69028-0_20openalex-snapshot
Behavioral Equivalence of Concurrent Systems
inferredcites →https://doi.org/10.1007/bfb0016220openalex-snapshot
A logical formalism for the study of the finite behaviour of Petri nets
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1634openalex-snapshot
Petri Net Languages and Infinite Subsets of Nm
inferred← citeshttps://doi.org/10.1007/11609773_20openalex-snapshot
Resource Usage Analysis for the π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_5openalex-snapshot
HMSCs as Partial Specifications...with PNs as Completions
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_21openalex-snapshot
Towards a Characterisation of Finite-State Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_12openalex-snapshot
Supervisory Control of Petri Nets with Language Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-45329-8_4openalex-snapshot
On the Containment Problem for Deterministic Multicounter Machine Models
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_17openalex-snapshot
Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_11openalex-snapshot
Unbounded Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-30470-8_95openalex-snapshot
On the Verification of Web Services Compatibility: A Petri Net Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_15openalex-snapshot
Language Theory of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_16openalex-snapshot
Complexity of Place / Transition Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-29072-5_4openalex-snapshot
Refinement and Asynchronous Composition of Modal Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0017144openalex-snapshot
Infinite behaviour of deterministic petri nets
inferred← citeshttps://doi.org/10.1007/s41870-024-01903-0openalex-snapshot
Partial Petri Net Languages and their Properties
inferred← citeshttps://doi.org/10.1007/s41870-024-02272-4openalex-snapshot
Watson-crick partial petri net languages and their properties
inferred← citeshttps://doi.org/10.1016/j.datak.2008.12.002openalex-snapshot
A scenario-based verification technique to assess the compatibility of collaborative business processes
inferred← citeshttps://doi.org/10.1023/a:1008271916548openalex-snapshot
A Survey of Petri Net Methods for Controlled Discrete Event Systems
inferred← citeshttps://doi.org/10.1109/9.384227openalex-snapshot
Decidability and closure properties of weak Petri net languages in supervisory control
inferred← citeshttps://doi.org/10.1109/9.545713openalex-snapshot
On asymptotically efficient solutions for a class of supervisory control problems
inferred← citeshttps://doi.org/10.1109/cdc.1993.325158openalex-snapshot
Weak Petri net languages in supervisory control
inferred← citeshttps://doi.org/10.1109/cdc.1997.652507openalex-snapshot
Petri net state estimators based on event observation
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343040openalex-snapshot
Deterministic λ-free Petri net languages and their application to the supervisory control of discrete event dynamic systems
inferred← citeshttps://doi.org/10.1109/tac.2002.800664openalex-snapshot
Sequential versus concurrent languages of labeled conflict-free Petri nets
inferred← citeshttps://doi.org/10.1109/tac.2002.802769openalex-snapshot
Observability of place/transition nets
inferred← citeshttps://doi.org/10.1109/tac.2006.875026openalex-snapshot
On Minimal Representations of Petri Net Languages
inferred← citeshttps://doi.org/10.1109/wodes.2002.1167694openalex-snapshot
On minimal representations of Petri net languages
inferred← citeshttps://doi.org/10.1145/505241.505246openalex-snapshot
Bounded concurrent timestamp systems using vector clocks
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:4)2006openalex-snapshot
Resource Usage Analysis for the Pi-Calculus
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:9)2012openalex-snapshot
Petri Net Reachability Graphs: Decidability Status of First Order Properties
inferred← citeshttps://doi.org/10.3233/fi-2018-1706openalex-snapshot
The Complexity of Diagnosability and Opacity Verification for Petri Nets
inferred← citeshttps://doi.org/10.4204/eptcs.51.2openalex-snapshot
On the Decidability of Non Interference over Unbounded 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.