On the public citation graph
Reduction and design of well-behaved concurrent systems
0 signed · 37 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-54430-5_88openalex-snapshot
Compositional synthesis of live and bounded free choice Petri nets
inferredcites →https://doi.org/10.1007/978-3-540-47919-2_13openalex-snapshot
Transformations and Decompositions of Nets
inferredcites →https://doi.org/10.1007/978-3-642-69028-0_2openalex-snapshot
Structural Transformations Giving B-Equivalent PT-Nets
inferredcites →https://doi.org/10.1007/bf01888220openalex-snapshot
Partial order behaviour and structure of Petri nets
inferredcites →https://doi.org/10.1007/bfb0019972openalex-snapshot
Top-down synthesis of live and bounded free choice nets
inferredcites →https://doi.org/10.1016/0022-0000(79)90050-3openalex-snapshot
Analysis of petri nets by stepwise refinements
inferredcites →https://doi.org/10.1016/0022-0000(83)90029-6openalex-snapshot
A method for stepwise refinement and abstraction of Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(84)90137-3openalex-snapshot
A theory of bipolar synchronization schemes
inferredcites →https://doi.org/10.1145/828.322441openalex-snapshot
Synthesis of a Class of Deadlock-Free Petri Nets
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.1994.1080openalex-snapshot
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_28openalex-snapshot
On the analysis and synthesis of free choice systems
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-60249-6_57openalex-snapshot
Computing Petri net languages by reductions
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_48openalex-snapshot
Verification of workflow nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_11openalex-snapshot
Reduction Using Induced Subnets to Systematically Prove Properties for Free-Choice Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-04915-1_4openalex-snapshot
Improved Net Reductions for LTL$$\setminus $$X Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_7openalex-snapshot
Attractor Equivalence: An Observational Semantics for Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_31openalex-snapshot
On Negotiation as Concurrency Primitive
inferred← citeshttps://doi.org/10.1007/bf03036471openalex-snapshot
Reduction rules for time Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0019972openalex-snapshot
Top-down synthesis of live and bounded free choice nets
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90048-kopenalex-snapshot
Traps characterize home states in free choice systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.06.327openalex-snapshot
An Abstraction Method of Interpreted Petri Nets Preserving the Equivalence of the Controllable Observable Language
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.010openalex-snapshot
Property-preserving subnet reductions for designing manufacturing systems with shared resources
inferred← citeshttps://doi.org/10.1016/s1567-8326(00)00004-7openalex-snapshot
Inheritance of behavior
inferred← citeshttps://doi.org/10.1093/comjnl/bxh125openalex-snapshot
Handling Synchronization Problem in Petri Net-Based System Design by Property-Preserving Transition-Reduction
inferred← citeshttps://doi.org/10.1109/apcas.1996.569288openalex-snapshot
Reachability criterion of live free choice Petri nets
inferred← citeshttps://doi.org/10.1109/csmr.1998.665802openalex-snapshot
Reengineering of distributed systems using formal methods
inferred← citeshttps://doi.org/10.1109/icycs.2008.128openalex-snapshot
Property Preservation by Petri-Net-Based Refinements in System Design
inferred← citeshttps://doi.org/10.1109/iitsi.2010.35openalex-snapshot
Property Preservation of Time Petri Net Reduction
inferred← citeshttps://doi.org/10.1109/pnpm.1991.238797openalex-snapshot
Overview of the results of the Esprit basic research action DEMON-design methods based on nets
inferred← citeshttps://doi.org/10.1109/tsmca.2012.2186440openalex-snapshot
Reduction and Refinement by Algebraic Operations for Petri Net Transformation
inferred← citeshttps://doi.org/10.1145/3686614.3686620openalex-snapshot
Program Dependence Net Reduction for LTL Model Checking
inferred← citeshttps://doi.org/10.3390/s21248433openalex-snapshot
Extended Hierarchical Fuzzy Interpreted Petri Net
inferred← citeshttps://doi.org/10.4304/jcp.6.8.1662-1669openalex-snapshot
Analysis and Application of Petri Subnet Reduction
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.