On the public citation graph
An Algorithm for the General Petri Net Reachability Problem
0 signed · 434 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/bf00289268openalex-snapshot
Persistence of vector replacement systems is decidable
inferredcites →https://doi.org/10.1016/0020-0190(80)90026-5openalex-snapshot
The decidability of persistence for vector addition systems
inferredcites →https://doi.org/10.1016/0022-0000(78)90021-1openalex-snapshot
A 222pn upper bound on the complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1016/0304-3975(77)90014-7openalex-snapshot
Complexity of some problems in Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(77)90059-7openalex-snapshot
Decidable problems on the strong connectivity of Petri net reachability sets
inferredcites →https://doi.org/10.1016/0304-3975(78)90020-8openalex-snapshot
Remarks on blind and partially blind one-way multicounter machines
inferredcites →https://doi.org/10.1016/0304-3975(79)90041-0openalex-snapshot
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/s0019-9958(77)90558-7openalex-snapshot
Petri nets and szilard languages
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1109/tc.1973.5009149openalex-snapshot
A Comparison of Some Theoretical Models of Parallel Computation
inferredcites →https://doi.org/10.1145/322261.322271openalex-snapshot
The Complexity of the Finite Containment Problem for Petri Nets
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
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.ch12openalex-snapshot
Verification of Specific Properties
inferred← citeshttps://doi.org/10.1002/9780470611647.ch4openalex-snapshot
Decidability and Complexity of Petri Net Problems
inferred← citeshttps://doi.org/10.1002/9781118602638.ch6openalex-snapshot
Introduction to Verification
inferred← citeshttps://doi.org/10.1002/9781118602638.ch8openalex-snapshot
Verification of Infinite‐State Systems
inferred← citeshttps://doi.org/10.1006/jcss.1999.1643openalex-snapshot
Petri Nets and Regular Processes
inferred← citeshttps://doi.org/10.1006/jvlc.1997.0053openalex-snapshot
On the Classification of Visual Languages by Grammar Hierarchies
inferred← citeshttps://doi.org/10.1007/10719839_37openalex-snapshot
Undecidable Problems in Unreliable Computations
inferred← citeshttps://doi.org/10.1007/11493402_3openalex-snapshot
Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective
inferred← citeshttps://doi.org/10.1007/11502593_8openalex-snapshot
Stably Computable Properties of Network Graphs
inferred← citeshttps://doi.org/10.1007/11533719_91openalex-snapshot
On Sequential and 1-Deterministic P Systems
inferred← citeshttps://doi.org/10.1007/11562948_36openalex-snapshot
Flat Counter Automata Almost Everywhere!
inferred← citeshttps://doi.org/10.1007/11609773_20openalex-snapshot
Resource Usage Analysis for the π-Calculus
inferred← citeshttps://doi.org/10.1007/11821069_26openalex-snapshot
Partially Commutative Inverse Monoids
inferred← citeshttps://doi.org/10.1007/11821069_53openalex-snapshot
A Reachability Algorithm for General Petri Nets Based on Transition Invariants
inferred← citeshttps://doi.org/10.1007/11874683_3openalex-snapshot
Automata and Logics for Words and Trees over an Infinite Alphabet
inferred← citeshttps://doi.org/10.1007/11921240_21openalex-snapshot
Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting
inferred← citeshttps://doi.org/10.1007/11944836_24openalex-snapshot
On Decidability of LTL Model Checking for Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_66openalex-snapshot
Degrees of non-determinism and concurrency: A Petri net view
inferred← citeshttps://doi.org/10.1007/3-540-18086-9_19openalex-snapshot
Recent results on the complexity of problems related to Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_44openalex-snapshot
Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_11openalex-snapshot
When Ambients Cannot Be Opened
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_31openalex-snapshot
An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_92openalex-snapshot
Interacting Automata for Modelling Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-44919-1_26openalex-snapshot
A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_51openalex-snapshot
Decidability Results for the Propositional Fluent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_7openalex-snapshot
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_17openalex-snapshot
Petri Nets with Simple Circuits
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-45610-4_9openalex-snapshot
Decidability and Closure Properties of Equational Tree Languages
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_5openalex-snapshot
Techniques for Decidability and Undecidability of Bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_32openalex-snapshot
Finding Paths with the Right Cost
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-50580-6_33openalex-snapshot
Some consequences of the decidability of the reachability problem for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_135openalex-snapshot
The reachability problem for ground TRS and some extensions
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_137openalex-snapshot
Compilation of ground term rewriting systems and applications (DEMO)
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_22openalex-snapshot
Normal and sinkless Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-55606-0_24openalex-snapshot
From elementary knowledge schemes towards heuristic expertise — Designing an its in the field of parallel programming
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_4openalex-snapshot
A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_38openalex-snapshot
Bounded self-stabilizing 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_41openalex-snapshot
An efficient algorithm for finding structural deadlocks in colored 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-56922-7_10openalex-snapshot
Reachability and recurrence in Extended Finite State Machines: Modular Vector Addition Systems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_66openalex-snapshot
Complexity results for 1-safe nets
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_173openalex-snapshot
Decidability questions for bisimilarity of Petri nets and some related problems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_119openalex-snapshot
Petri nets, Horn programs, Linear Logic, and vector games
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_19openalex-snapshot
Computational and concurrency models of linear logic
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_56openalex-snapshot
Deciding properties of integral relational automata
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_138openalex-snapshot
Proving non-reachability by modulo-place-invariants
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_206openalex-snapshot
High undecidability of weak bisimilarity for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60029-9_46openalex-snapshot
Handles and reachability analysis of free choice nets
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_26openalex-snapshot
Checking regular properties of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_42openalex-snapshot
On polynomial ideals, their complexity, and applications
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/3-540-65306-6_20openalex-snapshot
Decidability and complexity of Petri net problems — An introduction
inferred← citeshttps://doi.org/10.1007/978-0-387-73821-5_7openalex-snapshot
Insider Threat Assessment: Model, Analysis and Tool
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_4openalex-snapshot
The CCMG Visual Language Hierarchy
inferred← citeshttps://doi.org/10.1007/978-1-4615-2241-6_1openalex-snapshot
Detecting Block GI/M/1 and Block M/G/1 Matrices from Model Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-04771-9_24openalex-snapshot
Computing the Parallelism Degree of Timed BPMN Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_1openalex-snapshot
Theoretical Computer Science: Computability, Decidability and Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_23openalex-snapshot
Coverability and Termination in Recursive Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_27openalex-snapshot
Deciding Fast Termination for Probabilistic VASS with Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_22openalex-snapshot
KReach: A Tool for Reachability in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_18openalex-snapshot
A Lazy Query Scheme for Reachability Analysis in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_2openalex-snapshot
Flat Petri Nets (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_13openalex-snapshot
Petri Net Invariant Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_10openalex-snapshot
Coverability in 2-VASS with One Unary Counter is in NP
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_17openalex-snapshot
On the Reversibility of Circular Conservative Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_8openalex-snapshot
Concurrent Hyperproperties
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-031-57228-9_1openalex-snapshot
Ackermannian Completion of Separators
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_9openalex-snapshot
Reachability in Fixed VASS: Expressiveness and Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-031-75778-5_19openalex-snapshot
Ten Years of Petri Games
inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_5openalex-snapshot
Coverability in Well-Formed Free-Choice Nets
inferred← citeshttps://doi.org/10.1007/978-3-032-13711-1_9openalex-snapshot
Concurrent $$\forall \exists $$-Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-032-22730-0_4openalex-snapshot
Bridging the Gap Between Plain VASS and Branching VASS
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_17openalex-snapshot
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_14openalex-snapshot
A Note on Decidable Separability by Piecewise Testable Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-41312-9_1openalex-snapshot
Reachability Problems for Continuous Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-48057-2_7openalex-snapshot
Heuristic-Guided Verification for Fast Congestion Detection on Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_8openalex-snapshot
Deciding Structural Liveness of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-69462-7_38openalex-snapshot
Scalable Conformance Checking of Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_10openalex-snapshot
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_17openalex-snapshot
Reasoning About Reversal-Bounded Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_14openalex-snapshot
Quasi-Dynamic Scheduling for the Synthesis of Real-Time Embedded Software with Local and Global Deadlines
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-27793-4_24openalex-snapshot
Infinity of Intermediate States Is Decidable for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_26openalex-snapshot
On Flatness for 2-Dimensional Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_7openalex-snapshot
The Pros and Cons of Netcharts
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_13openalex-snapshot
Grammars With Regulated Rewriting
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-540-68746-7_19openalex-snapshot
Labeled Step Sequences in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_2openalex-snapshot
Model-Checking Large Finite-State Systems and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_21openalex-snapshot
Verifying Generalized Soundness of Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_53openalex-snapshot
Reachability in Unions of Commutative Rewriting Systems Is Decidable
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_8openalex-snapshot
Local Testing of Message Sequence Charts Is Difficult
inferred← citeshttps://doi.org/10.1007/978-3-540-77312-2_15openalex-snapshot
On the Dynamics of PB Systems with Volatile Membranes
inferred← citeshttps://doi.org/10.1007/978-3-540-77312-2_7openalex-snapshot
On the Reachability Problem in P Systems with Mobile Membranes
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_26openalex-snapshot
Reversal-Bounded Counter Machines Revisited
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-02737-6_40openalex-snapshot
Erasing in Petri Net Languages and Matrix Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_31openalex-snapshot
On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_37openalex-snapshot
Weak Time Petri Nets Strike Back!
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_33openalex-snapshot
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_19openalex-snapshot
Reachability Analysis of Communicating Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_39openalex-snapshot
The Downward-Closure of Petri Net Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_9openalex-snapshot
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_3openalex-snapshot
Counter Systems for Data Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_8openalex-snapshot
Verification of Graph Transformation Systems with Context-Free Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_14openalex-snapshot
On the Complexity of the Bernays-Schönfinkel Class with Datalog
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_19openalex-snapshot
Applying CEGAR to the Petri Net State Equation
inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_11openalex-snapshot
Finding a Witness Path for Non-liveness in Free-Choice Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_22openalex-snapshot
Vector Addition System Reversible Reachability Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_5openalex-snapshot
Structure Theory of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_10openalex-snapshot
Well-Structured Pushdown Systems
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-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_16openalex-snapshot
Branching-Time Model Checking Gap-Order Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-10427-9_4openalex-snapshot
Die Entscheidbarkeit des Erreichbarkeitsproblems
inferred← citeshttps://doi.org/10.1007/978-3-662-58381-4_1openalex-snapshot
Computing Alignments of Event Data and Process Models
inferred← citeshttps://doi.org/10.1007/978-3-662-60651-3_2openalex-snapshot
How Petri Net Theory Serves Petri Net Model Checking: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_11openalex-snapshot
A Gentle Tour Through A Petri Net Model Checking Tool
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_5openalex-snapshot
The Reachability Problem in Petri Nets: Decidability and Hardness
inferred← citeshttps://doi.org/10.1007/978-4-431-66979-1_30openalex-snapshot
Distributed Multimedia Presentation with Floor Control Mechanisms in a Distance Learning System
inferred← citeshttps://doi.org/10.1007/978-981-97-3597-6_12openalex-snapshot
Intersection Deadlock Probability: Stochastic Petri Net Approach
inferred← citeshttps://doi.org/10.1007/bf00263503openalex-snapshot
Scattered versus context-sensitive rewriting
inferred← citeshttps://doi.org/10.1007/bf01178259openalex-snapshot
Bounded self-stabilizing Petri nets
inferred← citeshttps://doi.org/10.1007/bf01178731openalex-snapshot
Petri net algorithms in the theory of matrix grammars
inferred← citeshttps://doi.org/10.1007/bf02090765openalex-snapshot
Communicating processes, scheduling, and the complexity of nontermination
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/bf02714572openalex-snapshot
Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0014567openalex-snapshot
Combining Petri nets and PA-processes
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/bfb0020814openalex-snapshot
Reachability in reversible Free Choice systems
inferred← citeshttps://doi.org/10.1007/bfb0023850openalex-snapshot
Data structures and terminating Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0026564openalex-snapshot
Simulating guarded programs in linear logic
inferred← citeshttps://doi.org/10.1007/bfb0028573openalex-snapshot
Hierarchies of principal twist-closed trios
inferred← citeshttps://doi.org/10.1007/bfb0029006openalex-snapshot
Decidability of weak fairness in petri nets
inferred← citeshttps://doi.org/10.1007/bfb0039619openalex-snapshot
On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states
inferred← citeshttps://doi.org/10.1007/bfb0039622openalex-snapshot
Decidability questions for fairness in Petri nets
inferred← citeshttps://doi.org/10.1007/bfb0042308openalex-snapshot
Analysis and control of discrete event systems represented by petri nets
inferred← citeshttps://doi.org/10.1007/bfb0049331openalex-snapshot
Petri nets and the equivalence problem
inferred← citeshttps://doi.org/10.1007/bfb0052082openalex-snapshot
On twist-closed trios: A new morphic characterization of r.e. sets
inferred← citeshttps://doi.org/10.1007/bfb0058039openalex-snapshot
Polynomial-Time Many-One reductions for Petri nets
inferred← citeshttps://doi.org/10.1007/s00165-008-0081-8openalex-snapshot
Reachability analysis of fragments of mobile ambients in AC term rewriting
inferred← citeshttps://doi.org/10.1007/s00186-011-0353-6openalex-snapshot
Encoding the dynamics of deterministic systems
inferred← citeshttps://doi.org/10.1007/s00224-021-10031-2openalex-snapshot
Reachability Problems on Reliable and Lossy Queue Automata
inferred← citeshttps://doi.org/10.1007/s00233-008-9060-xopenalex-snapshot
Partially commutative inverse monoids
inferred← citeshttps://doi.org/10.1007/s00236-005-0179-xopenalex-snapshot
Type-based information flow analysis for the π-calculus
inferred← citeshttps://doi.org/10.1007/s00236-008-0082-3openalex-snapshot
On decidability of LTL model checking for process rewrite systems
inferred← citeshttps://doi.org/10.1007/s00236-019-00338-6openalex-snapshot
Structural liveness of Petri nets is ExpSpace-hard and decidable
inferred← citeshttps://doi.org/10.1007/s002360050012openalex-snapshot
Bounded self-stabilizing Petri nets
inferred← citeshttps://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferred← citeshttps://doi.org/10.1007/s00287-010-0475-xopenalex-snapshot
Carl Adam Petri 1926–2010 – Visionär und bedeutender Wissenschaftler
inferred← citeshttps://doi.org/10.1007/s00287-013-0755-3openalex-snapshot
Explizites Model Checking: Welche Vorteile bieten Petrinetze?
inferred← citeshttps://doi.org/10.1007/s10009-016-0412-7openalex-snapshot
A unified view of parameterized verification of abstract models of broadcast communication
inferred← citeshttps://doi.org/10.1007/s10009-018-0486-5openalex-snapshot
Assessing SMT and CLP approaches for workflow nets verification
inferred← citeshttps://doi.org/10.1007/s10270-014-0422-4openalex-snapshot
The Petri net twist in explicit model checking
inferred← citeshttps://doi.org/10.1007/s10626-020-00311-3openalex-snapshot
On detectability of labeled Petri nets and finite automata
inferred← citeshttps://doi.org/10.1007/s10626-025-00412-xopenalex-snapshot
Optimization-based computation of bounded sequences to reach target states in DESs
inferred← citeshttps://doi.org/10.1007/s10703-023-00431-0openalex-snapshot
Round- and context-bounded control of dynamic pushdown systems
inferred← citeshttps://doi.org/10.1007/s10817-010-9190-1openalex-snapshot
Collaborative Planning with Confidentiality
inferred← citeshttps://doi.org/10.1007/s11047-010-9214-0openalex-snapshot
On the verification of membrane systems with dynamic structure
inferred← citeshttps://doi.org/10.1007/s11047-015-9501-xopenalex-snapshot
Probability 1 computation with chemical reaction networks
inferred← citeshttps://doi.org/10.1007/s11047-015-9506-5openalex-snapshot
Minimal output unstable configurations in chemical reaction networks and deciders
inferred← citeshttps://doi.org/10.1007/s11047-018-9723-9openalex-snapshot
Computing with chemical reaction networks: a tutorial
inferred← citeshttps://doi.org/10.1007/s11432-014-5239-9openalex-snapshot
Macro liveness graph and liveness of ω-independent unbounded nets
inferred← citeshttps://doi.org/10.1007/s11576-007-0136-0openalex-snapshot
Product Lines for Digital Information Products
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90004-2openalex-snapshot
The complexity of problems involving structurally bounded and conservative Petri nets
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90013-xopenalex-snapshot
Completeness results for conflict-free vector replacement systems
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90012-8openalex-snapshot
Finite automata on directed graphs
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90046-yopenalex-snapshot
Normal and sinkless petri nets
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00060-gopenalex-snapshot
Petri nets, Horn programs, Linear Logic and vector games
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90011-6openalex-snapshot
Linear logic as a logic of computations
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90026-5openalex-snapshot
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
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(89)90055-8openalex-snapshot
Projections of vector addition system reachability sets are semilinear
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90006-4openalex-snapshot
Decidability of a temporal logic problem for 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/0304-3975(92)90002-wopenalex-snapshot
The context-freeness of the languages associated with vector addition systems is decidable
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90173-dopenalex-snapshot
A structure to decide reachability in Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90339-hopenalex-snapshot
Concurrent regular expressions and their relationship to Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90154-lopenalex-snapshot
Reachability in cyclic extended free-choice systems
showing the first 200 of 418 · page through all 418
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.