On the public citation graph
Distributing Finite Automata Through Petri Net Synthesis
0 signed · 67 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-48745-x_18openalex-snapshot
Concurrent Implementation of Asynchronous Transition Systems
inferredcites →https://doi.org/10.1007/3-540-59293-8_207openalex-snapshot
Polynomial algorithms for the synthesis of bounded nets
inferredcites →https://doi.org/10.1007/978-1-4471-3078-9openalex-snapshot
Structures in Concurrency Theory
inferredcites →https://doi.org/10.1007/978-1-4471-3078-9_5openalex-snapshot
On The Synchronic Structure of Transition Systems
inferredcites →https://doi.org/10.1007/978-1-4615-4493-7_41openalex-snapshot
Supervisory Control in Discrete Event Systems Using the Theory of Regions
inferredcites →https://doi.org/10.1007/s002360050046openalex-snapshot
The synthesis problem of Petri nets
inferredcites →https://doi.org/10.1016/s0304-3975(96)00219-8openalex-snapshot
The synthesis problem for elementary net systems is NP-complete
inferredcites →https://doi.org/10.1023/a:1008649930696openalex-snapshot
Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/12.707587openalex-snapshot
Deriving Petri nets from finite transition systems
inferredcites →https://doi.org/10.1109/async.1996.494436openalex-snapshot
Complete state encoding based on the theory of regions
inferredcites →https://doi.org/10.1142/s0129054192000231openalex-snapshot
PETRI NETS AND STEP TRANSITION SYSTEMS
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.441openalex-snapshot
A framework for automatic generation of security controller
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/978-3-030-14812-6_38openalex-snapshot
The Complexity of Synthesis for 43 Boolean Petri Net Types
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_10openalex-snapshot
Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_9openalex-snapshot
Hardness Results for the Synthesis of b-bounded Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_1openalex-snapshot
Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account
inferred← citeshttps://doi.org/10.1007/978-3-030-61739-4_10openalex-snapshot
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_13openalex-snapshot
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_15openalex-snapshot
Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_12openalex-snapshot
Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues
inferred← citeshttps://doi.org/10.1007/978-3-031-10363-6_2openalex-snapshot
Complexity of Distributed Petri Net Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_5openalex-snapshot
The Power of Prime Cycles
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_6openalex-snapshot
Petri Net Synthesis for Restricted Classes of Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_4openalex-snapshot
Petri Net Synthesis with Union/Find
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-45187-7_1openalex-snapshot
Distributed Monitoring of Concurrent and Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_22openalex-snapshot
On Distributability of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_1openalex-snapshot
Petri Net Distributability
inferred← citeshttps://doi.org/10.1007/978-3-642-33704-8_3openalex-snapshot
From Qualitative to Quantitative Enforcement of Security Policy
inferred← citeshttps://doi.org/10.1007/978-3-642-35179-2_2openalex-snapshot
Distributed Control of Discrete-Event Systems: A First Step
inferred← citeshttps://doi.org/10.1007/978-3-642-37291-9_24openalex-snapshot
Augmenting High-Level Petri Nets to Support GALS Distributed Embedded Systems Specification
inferred← citeshttps://doi.org/10.1007/s00236-017-0310-9openalex-snapshot
Bounded choice-free Petri net synthesis: algorithmic issues
inferred← citeshttps://doi.org/10.1007/s10626-005-5238-5openalex-snapshot
Distributed Monitoring of Concurrent and Asynchronous Systems*
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.004openalex-snapshot
The synthesis of Petri nets from path-automatic specifications
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.06.015openalex-snapshot
Ad hoc systems management and specification with distributed Petri nets
inferred← citeshttps://doi.org/10.1016/j.scico.2017.07.005openalex-snapshot
Pre-synthesis of Petri nets based on prime cycles and distance paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.014openalex-snapshot
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.042openalex-snapshot
Synthesising elementary net systems with localities
inferred← citeshttps://doi.org/10.1017/s0960129514000644openalex-snapshot
Synchrony versus causality in distributed systems
inferred← citeshttps://doi.org/10.1109/acsd.2005.33openalex-snapshot
Two-Phase Distributed Observation Problems
inferred← citeshttps://doi.org/10.1109/acsd.2007.33openalex-snapshot
Synthesis and Control of Asynchronous and Distributed Systems
inferred← citeshttps://doi.org/10.1109/acsd.2011.16openalex-snapshot
Building Tight Occurrence Nets from Reveals Relations
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582472openalex-snapshot
Distributed implementations of Ramadge-Wonham supervisory control with Petri nets
inferred← citeshttps://doi.org/10.1109/icit.2013.6505879openalex-snapshot
Towards distributed execution of Petri net conflicts through model transformation
inferred← citeshttps://doi.org/10.1109/icma.2010.5588899openalex-snapshot
On the transformation from automata into Petri Nets in FMS
inferred← citeshttps://doi.org/10.1142/s0218843004000973openalex-snapshot
BRIDGING THE GAP BETWEEN BUSINESS MODELS AND WORKFLOW SPECIFICATIONS
inferred← citeshttps://doi.org/10.1145/3482898.3483362openalex-snapshot
Correct-by-Construction Network Programming for Stateful Data-Planes
inferred← citeshttps://doi.org/10.18419/opus-2573openalex-snapshot
Automatic synthesis of distributed transition systems
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:17)2013openalex-snapshot
On Characterising Distributability
inferred← citeshttps://doi.org/10.31577/cai_2020_1-2_174openalex-snapshot
A Method for Learning a Petri Net Model Based on Region Theory
inferred← citeshttps://doi.org/10.3233/fi-2013-809openalex-snapshot
Building Occurrence Nets from Reveals Relations
inferred← citeshttps://doi.org/10.3233/fi-2021-2084openalex-snapshot
The Complexity of Synthesis of $b$-Bounded Petri Nets
inferred← citeshttps://doi.org/10.3233/fi-222136openalex-snapshot
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
inferred← citeshttps://doi.org/10.4018/978-1-61520-668-1.ch014openalex-snapshot
A System Approach to Describing, Analysing and Control of the Behaviour of Agents in MAS
inferred← citeshttps://doi.org/10.4204/eptcs.324.7openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
inferred← citeshttps://doi.org/10.4204/eptcs.64.9openalex-snapshot
Synchrony vs. Causality in Asynchronous Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1207.3597openalex-snapshot
On Distributability of Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1904.01094openalex-snapshot
Hardness Results for the Synthesis of $b$-bounded Petri Nets (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12372openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)
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.