On the public citation graph
The residue of vector sets with applications to decidability problems in Petri nets
0 signed · 92 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-07141-5_234openalex-snapshot
Vermeidung von Verklemmungen in Bewerteten Petrinetzen
inferredcites →https://doi.org/10.1007/3-540-08921-7_69openalex-snapshot
Facts in place/transition-nets
inferredcites →https://doi.org/10.1007/3-540-10001-6_23openalex-snapshot
Formal properties of place/transition nets
inferredcites →https://doi.org/10.1007/3-540-15204-0_6openalex-snapshot
Infinite behaviour and fairness in petri nets
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/bfb0016216openalex-snapshot
Safe states in Banker like resource allocation Problems
inferredcites →https://doi.org/10.1016/0021-8693(69)90070-2openalex-snapshot
Rational sets in commutative monoids
inferredcites →https://doi.org/10.1016/0022-0000(81)90067-2openalex-snapshot
Petri nets and regular languages
inferredcites →https://doi.org/10.1016/0304-3975(76)90008-6openalex-snapshot
The equality problem for vector addition systems is undecidable
inferredcites →https://doi.org/10.1016/0304-3975(78)90036-1openalex-snapshot
The covering and boundedness problems for vector addition systems
inferredcites →https://doi.org/10.1016/0304-3975(83)90115-9openalex-snapshot
Infinite behaviour of Petri nets
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1109/swat.1974.28openalex-snapshot
The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611647.ch4openalex-snapshot
Decidability and Complexity of Petri Net Problems
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_43openalex-snapshot
A generalization of the procedure of karp and miller to well structured transition systems
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_4openalex-snapshot
Timing Parameter Characterization of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_30openalex-snapshot
Model Checking Lossy Vector Addition Systems
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_52openalex-snapshot
Deterministic systems of sequential processes: Theory and tools
inferred← citeshttps://doi.org/10.1007/3-540-50580-6_26openalex-snapshot
A survey on the decidability questions for classes of fifo nets
inferred← citeshttps://doi.org/10.1007/3-540-50580-6_30openalex-snapshot
On questions of fairness and temporal logic for conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_53openalex-snapshot
Deterministic systems of sequential processes: A class of structured Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56863-8_64openalex-snapshot
A unified approach for reasoning about conflict-free Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_40openalex-snapshot
Real-time system verification using P/T nets
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_71openalex-snapshot
Constrained properties, semilinear systems, and Petri nets
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_3openalex-snapshot
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_7openalex-snapshot
Controlling a Random Population
inferred← citeshttps://doi.org/10.1007/978-3-031-50524-9_7openalex-snapshot
Resilience and Home-Space for WSTS
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_18openalex-snapshot
Covering Fairness against Conspiracies
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_6openalex-snapshot
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_19openalex-snapshot
Nets with Tokens Which Carry Data
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_27openalex-snapshot
Computing Minimal Elements of Upward-Closed Sets for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_25openalex-snapshot
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_11openalex-snapshot
On the Relationship between Spatial Logics and Behavioral Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_40openalex-snapshot
Reachability Games on Extended Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_10openalex-snapshot
Complexity Analysis of the Backward Coverability Algorithm for VASS
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_6openalex-snapshot
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_7openalex-snapshot
Cost Soundness for Priced Resource-Constrained Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-38697-8_20openalex-snapshot
Channel Properties of Asynchronously Composed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_11openalex-snapshot
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_9openalex-snapshot
Solving Parity Games on Integer Vectors
inferred← citeshttps://doi.org/10.1007/978-3-662-60651-3_3openalex-snapshot
Parametric Verification: An Introduction
inferred← citeshttps://doi.org/10.1007/bf02679458openalex-snapshot
Deciding a Class of Path Formulas for Conflict-Free Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0016216openalex-snapshot
Safe states in Banker like resource allocation Problems
inferred← citeshttps://doi.org/10.1007/bfb0017158openalex-snapshot
A taxonomy of fairness and temporal logic problems for petri nets
inferred← citeshttps://doi.org/10.1007/bfb0017477openalex-snapshot
On the decidability of model checking for several μ-calculi and Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0039622openalex-snapshot
Decidability questions for fairness in Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0054314openalex-snapshot
Fundamental structures in Well-Structured infinite Transition Systems
inferred← citeshttps://doi.org/10.1007/s10626-006-0021-9openalex-snapshot
Supervision Based on Place Invariants: A Survey
inferred← citeshttps://doi.org/10.1007/s10626-014-0202-xopenalex-snapshot
Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
inferred← citeshttps://doi.org/10.1007/s10626-021-00340-6openalex-snapshot
On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary petri net
inferred← citeshttps://doi.org/10.1007/s10845-014-0888-5openalex-snapshot
A software tool for the automatic synthesis of minimally restrictive liveness enforcing supervisory policies for a class of general Petri net models of manufacturing- and service-systems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90053-4openalex-snapshot
Problems concerning fairness and temporal logic for conflict-free petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90002-2openalex-snapshot
Safe states in Banker-like resource allocation problems
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90009-7openalex-snapshot
Reduction and covering of infinite reachability trees
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90059-oopenalex-snapshot
A unified approach for deciding the existence of certain petri net paths
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2004.01.005openalex-snapshot
A well-structured framework for analysing petri net extensions
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.014openalex-snapshot
On selective unboundedness of VASS
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.014openalex-snapshot
Reachability solution characterization of parametric real-time systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.036openalex-snapshot
On minimal elements of upward-closed sets
inferred← citeshttps://doi.org/10.1016/s0005-1098(02)00266-2openalex-snapshot
Linear control of live marked graphs
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/cdc.1993.325158openalex-snapshot
Weak Petri net languages in supervisory control
inferred← citeshttps://doi.org/10.1109/iciea.2017.8282883openalex-snapshot
Software-based synthesis of maximally permissive liveness enforcing supervisory policies for a class of general Petri nets
inferred← citeshttps://doi.org/10.1109/icnsc.2013.6548770openalex-snapshot
On the automatic generation of the minimally restrictive liveness enforcing supervisory policy for manufacturing- and service-systems modeled by a class of general Free Choice Petri nets
inferred← citeshttps://doi.org/10.1109/lics.2011.40openalex-snapshot
Computing Optimal Coverability Costs in Priced Timed Petri Nets
inferred← citeshttps://doi.org/10.1109/tac.2003.819078openalex-snapshot
Design of T-liveness enforcing supervisors in petri nets
inferred← citeshttps://doi.org/10.1109/tac.2011.2159883openalex-snapshot
On the Existence of Supervisory Policies That Enforce Liveness in Partially Controlled Free-Choice Petri Nets
inferred← citeshttps://doi.org/10.1109/tac.2014.2362594openalex-snapshot
On a Sufficient Information Structure for Supervisory Policies That Enforce Liveness in a Class of General Petri Nets
inferred← citeshttps://doi.org/10.1109/tase.2012.2227961openalex-snapshot
On Deciding the Existence of a Liveness Enforcing Supervisory Policy in a Class of Partially Controlled General Free-Choice Petri Nets
inferred← citeshttps://doi.org/10.1142/s0129054111008428openalex-snapshot
ON YEN'S PATH LOGIC FOR PETRI NETS
inferred← citeshttps://doi.org/10.1145/1480881.1480895openalex-snapshot
Verifying liveness for asynchronous programs
inferred← citeshttps://doi.org/10.1145/1594834.1480895openalex-snapshot
Verifying liveness for asynchronous programs
inferred← citeshttps://doi.org/10.1145/2535838.2535877openalex-snapshot
Verifying eventual consistency of optimistic replication systems
inferred← citeshttps://doi.org/10.1145/2578855.2535877openalex-snapshot
Verifying eventual consistency of optimistic replication systems
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:11)2012openalex-snapshot
Model Checking Vector Addition Systems with one zero-test
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d60openalex-snapshot
Controlling a random population
inferred← citeshttps://doi.org/10.3182/20121003-3-mx-4033.00047openalex-snapshot
Maximally Permissive Deadlock Avoidance for Resource Allocation Systems with R/W-Locks
inferred← citeshttps://doi.org/10.3233/fi-2014-1004openalex-snapshot
Safety and Soundness for Priced Resource-Constrained Workflow Nets
inferred← citeshttps://doi.org/10.3233/fun-2006-70406openalex-snapshot
Decidability Analysis of Self-Stabilization for Infinite-State Systems
inferred← citeshttps://doi.org/10.4204/eptcs.350.5openalex-snapshot
Resilience of Well-structured Graph Transformation Systems
inferred← citeshttps://doi.org/10.5281/zenodo.210354openalex-snapshot
FIGURE 16 in A new dasyurid marsupial from eastern Queensland, Australia: the Buff-footed Antechinus, Antechinus mysticus sp. nov. (Marsupialia: Dasyuridae)
inferred← citeshttps://doi.org/10.70675/4a3d121bzbb9az47ebzb688z4c3e0339c01bopenalex-snapshot
On Effective Representations of Well Quasi-Orderings
inferred← citeshttps://doi.org/10.70675/6c9d51cbze0efz4fdezb9b8z4ddc2f8fce0fopenalex-snapshot
Subwords : automata, embedding problems, and verification
inferred← citeshttps://doi.org/10.70675/c9f24568z9953z41e1z89d8z3098ec562a64openalex-snapshot
Discrete Parameters in Petri Nets
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for 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.