On the public citation graph
Reset nets between decidability and undecidability
0 signed · 255 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-08860-1_35openalex-snapshot
Self-modifying nets, a natural extension of Petri nets
inferredcites →https://doi.org/10.1007/3-540-08921-7_101openalex-snapshot
On the computational power of extended petri nets
inferredcites →https://doi.org/10.1007/3-540-58152-9openalex-snapshot
Application and Theory of Petri Nets 1994
inferredcites →https://doi.org/10.1007/3-540-58152-9_11openalex-snapshot
Petri nets with marking-dependent arc cardinality: Properties and analysis
inferredcites →https://doi.org/10.1007/3-540-63139-9_44openalex-snapshot
Coupling asynchrony and interrupts: Place Chart Nets
inferredcites →https://doi.org/10.1007/bfb0054314openalex-snapshot
Fundamental structures in Well-Structured infinite Transition Systems
inferredcites →https://doi.org/10.1016/0304-3975(76)90067-0openalex-snapshot
Some decision problems related to the reachability problem for Petri nets
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/0378-4754(82)90066-0openalex-snapshot
Petri Net theory and the modeling of systems
inferredcites →https://doi.org/10.1016/0890-5401(90)90009-7openalex-snapshot
Reduction and covering of infinite reachability trees
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1016/s0304-3975(01)00234-1openalex-snapshot
Partial order semantics and read arcs
inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot
General decidability theorems for infinite-state 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.1002/9781118602638.ch6openalex-snapshot
Introduction to Verification
inferred← citeshttps://doi.org/10.1007/10719839_37openalex-snapshot
Undecidable Problems in Unreliable Computations
inferred← citeshttps://doi.org/10.1007/11494744_24openalex-snapshot
Achieving a General, Formal and Decidable Approach to the OR-Join in Workflow Using Reset Nets
inferred← citeshttps://doi.org/10.1007/11609773_4openalex-snapshot
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS
inferred← citeshttps://doi.org/10.1007/11841197_8openalex-snapshot
Translating Orc Features into Petri Nets and the Join Calculus
inferred← citeshttps://doi.org/10.1007/11841760_28openalex-snapshot
Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
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-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-44988-4_12openalex-snapshot
Decidability of Properties of Timed-Arc Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_8openalex-snapshot
Temporary Data in Shared Dataspace Coordination Languages
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_3openalex-snapshot
On the Expressiveness of Event Notification in Data-Driven Coordination Languages
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_29openalex-snapshot
Decidability of Reachability Problems for Classes of Two Counters Automata
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_18openalex-snapshot
Some Decidability Results for Nested Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_27openalex-snapshot
Boundedness of Reset P/T Nets
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_14openalex-snapshot
Theoretical Aspects of Recursive Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_16openalex-snapshot
Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_30openalex-snapshot
Model Checking Lossy Vector Addition Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35520-7_1openalex-snapshot
On the Semantics of Javaspaces
inferred← citeshttps://doi.org/10.1007/978-3-030-30806-3_15openalex-snapshot
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_17openalex-snapshot
Dynamic Recursive Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_8openalex-snapshot
Complexity of Verification and Synthesis of Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_1openalex-snapshot
Directed Reachability for Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_24openalex-snapshot
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_14openalex-snapshot
Synthesis of (Choice-Free) Reset Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-89716-1_4openalex-snapshot
Recent Advances on Reachability Problems for Valence Systems (Invited Talk)
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-08679-3_4openalex-snapshot
Branch-Well-Structured Transition Systems and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-031-09843-7_3openalex-snapshot
Decidability of Resilience for Well-Structured Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-17604-3_8openalex-snapshot
Enhanced Transformation of BPMN Models with Cancellation Features
inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_11openalex-snapshot
What Else is Undecidable About Loops?
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-031-94634-9_16openalex-snapshot
Decidability Problems for Weak Time Petri Nets with Read, Reset and Transfer Arcs
inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_2openalex-snapshot
Petri Nets and Higher-Dimensional Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-95589-1_7openalex-snapshot
Decidability Problems for Micro-Stipula
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_30openalex-snapshot
Safety and Reachability in k-Control Games on Integer Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_10openalex-snapshot
Looking at Mean-Payoff and Total-Payoff through Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_15openalex-snapshot
On Functions Weakly Computable by Petri Nets and Vector Addition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_9openalex-snapshot
Integer Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-319-19090-7_12openalex-snapshot
Eval-net: Elements of Evaluation Nets as Extension to Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_11openalex-snapshot
Petri Nets with Structured Data
inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_7openalex-snapshot
Discrete Parameters in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-23063-4_4openalex-snapshot
Specification and Verification of Complex Business Processes - A High-Level Petri Net-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_22openalex-snapshot
When to Move to Transfer Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-39417-6_1openalex-snapshot
Fundamental Conceptual Modeling Languages in OMiLAB
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_1openalex-snapshot
The Ideal Theory for WSTS
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_7openalex-snapshot
Synthesis of Petri Nets with Whole-Place Operations and Localities
inferred← citeshttps://doi.org/10.1007/978-3-319-92408-3_2openalex-snapshot
Foundations of Coordination and Contracts and Their Contribution to Session Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-24619-0_11openalex-snapshot
On the Dynamics of PB Systems: A Petri Net View
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_42openalex-snapshot
FASTer Acceleration of Counter Automata in Practice
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_14openalex-snapshot
Polynomial Time Image Computation with Interval-Definable Counters Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_16openalex-snapshot
Properties of Object Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_28openalex-snapshot
Image Computation in Infinite State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_12openalex-snapshot
Disjunctive Invariants for Numerical Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_26openalex-snapshot
Introducing Structural Dynamic Changes in Petri Nets: Marked-Controlled Reconfigurable Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_24openalex-snapshot
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_29openalex-snapshot
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_28openalex-snapshot
Dynamic Modification of System Structures Using LLPNs
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-74915-8_11openalex-snapshot
Comparing the Expressive Power of Well-Structured Transition Systems
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-79230-7_6openalex-snapshot
A Feature-Complete Petri Net Semantics for WS-BPEL 2.0
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_2openalex-snapshot
Discovery, Verification and Conformance of Workflows with Cancellation
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_29openalex-snapshot
Tree Pattern Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-00899-3_3openalex-snapshot
Petri Net Transformations for Business Processes – A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_6openalex-snapshot
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_16openalex-snapshot
Forward Analysis for WSTS, Part II: Complete WSTS
inferred← citeshttps://doi.org/10.1007/978-3-642-03121-2_2openalex-snapshot
The Language: Rationale and Fundamentals
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-04856-2_3openalex-snapshot
Soundness of Workflow Nets with Reset Arcs
inferred← citeshttps://doi.org/10.1007/978-3-642-04856-2_6openalex-snapshot
Modelling Mobile IP with Mobile 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-13675-7_12openalex-snapshot
Forward Analysis for Petri Nets with Name Creation
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_2openalex-snapshot
Noetherian Spaces in Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_54openalex-snapshot
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_4openalex-snapshot
Lossy Counter Machines Decidability Cheat Sheet
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_29openalex-snapshot
Ideal Abstractions for Well-Structured Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_17openalex-snapshot
Catalytic Petri Nets Are Turing Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_18openalex-snapshot
Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_2openalex-snapshot
The Theory of WSTS: The Case of Complete WSTS
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_6openalex-snapshot
Complexity of the Soundness Problem of Bounded Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_31openalex-snapshot
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_5openalex-snapshot
Structural Counter Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_2openalex-snapshot
History-Register Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38667-1_45openalex-snapshot
Research on Workflow Model Based on Petri Net with Reset Arcs
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_24openalex-snapshot
Automatic Verification of Erlang-Style Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-39088-3_1openalex-snapshot
Modelling and Analysis of Flexible Healthcare Processes Based on Algebraic and Recursive Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_10openalex-snapshot
Incremental, Inductive Coverability
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_37openalex-snapshot
Reachability in Register Machines with Polynomial Updates
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_2openalex-snapshot
Handling Infinitely Branching WSTS
inferred← citeshttps://doi.org/10.1007/s00165-010-0161-4openalex-snapshot
Soundness of workflow nets: classification, decidability, and analysis
inferred← citeshttps://doi.org/10.1007/s00165-018-0460-8openalex-snapshot
Parameterized verification of monotone information systems
inferred← citeshttps://doi.org/10.1007/s00236-013-0188-0openalex-snapshot
Petri nets with name creation for transient secure association
inferred← citeshttps://doi.org/10.1007/s00450-009-0059-7openalex-snapshot
Surmounting BPM challenges: the YAWL story
inferred← citeshttps://doi.org/10.1007/s00607-023-01183-9openalex-snapshot
A GSPN-based formalism under infinite-server semantics for reconfigurable WANETs
inferred← citeshttps://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
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-026-00841-5openalex-snapshot
Clause-reachability is undecidable in legal contracts
inferred← citeshttps://doi.org/10.1007/s10703-012-0168-yopenalex-snapshot
Computable fixpoints in well-structured symbolic model checking
inferred← citeshttps://doi.org/10.1007/s10796-022-10243-yopenalex-snapshot
IT Availability Risks in Smart Factory Networks – Analyzing the Effects of IT Threats on Production Processes Using Petri Nets
inferred← citeshttps://doi.org/10.1007/s42979-020-00215-xopenalex-snapshot
On Enabling GDPR Compliance in Business Processes Through Data-Driven Solutions
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2013.09.001openalex-snapshot
Half a century after Carl Adam Petri’s Ph.D. thesis: A perspective on the field
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.10.005openalex-snapshot
Petri Nets with Non-blocking Arcs are Difficult to Analyze
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.10.007openalex-snapshot
The Affine Hull of a Binary Automaton is Computable in Polynomial Time
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.030openalex-snapshot
On the ω-language Expressive Power of Extended Petri Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.003openalex-snapshot
Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.006openalex-snapshot
About Fast and TReX Accelerations
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.ic.2010.11.003openalex-snapshot
A classification of the expressive power of well-structured transition systems
inferred← citeshttps://doi.org/10.1016/j.ic.2014.08.008openalex-snapshot
Catalytic and communicating Petri nets are Turing complete
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.010openalex-snapshot
Looking at mean-payoff and total-payoff through windows
inferred← citeshttps://doi.org/10.1016/j.ic.2017.11.001openalex-snapshot
Handling infinitely branching well-structured transition systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104592openalex-snapshot
Parameterized verification of coverability in infinite state broadcast networks
inferred← citeshttps://doi.org/10.1016/j.infsof.2008.12.002openalex-snapshot
Reduction rules for YAWL workflows with cancellation regions and OR-joins
inferred← citeshttps://doi.org/10.1016/j.ins.2008.10.033openalex-snapshot
Soundness-preserving reduction rules for reset workflow nets
inferred← citeshttps://doi.org/10.1016/j.ins.2016.12.044openalex-snapshot
Formal verification of complex business processes based on high-level Petri nets
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.009openalex-snapshot
Boundedness undecidability for synchronized nets
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.09.001openalex-snapshot
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.06.003openalex-snapshot
Reduction rules for reset/inhibitor nets
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.014openalex-snapshot
On selective unboundedness of VASS
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100527openalex-snapshot
Process calculi as a tool for studying coordination, contracts and session types
inferred← citeshttps://doi.org/10.1016/j.ress.2017.02.012openalex-snapshot
A modelling approach for railway overhead line equipment asset management
inferred← citeshttps://doi.org/10.1016/j.scico.2010.06.012openalex-snapshot
simpA: An agent-oriented approach for programming concurrent applications on top of Java
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.002openalex-snapshot
Simulation of multicellular populations with Petri nets and genome scale intracellular networks
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.008openalex-snapshot
Reversible computation vs. reversibility in Petri nets
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102302openalex-snapshot
Reconfigurable GSPNs: A modeling formalism of evolvable discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.036openalex-snapshot
Tree automata with one memory set constraints and cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.008openalex-snapshot
On the ω -language expressive power of extended Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.01.003openalex-snapshot
Operational semantics for Petri net components
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.007openalex-snapshot
Decidability and complexity of Petri nets with unordered data
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.056openalex-snapshot
Reachability problems in BioAmbients
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.021openalex-snapshot
On the coverability and reachability languages of monotonic extensions of Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.005openalex-snapshot
The expressive power of time Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.020openalex-snapshot
Forward analysis and model checking for trace bounded WSTS
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.017openalex-snapshot
Context-free commutative grammars with integer counters and resets
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00337-4openalex-snapshot
Verifying lossy channel systems has nonprimitive recursive complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00646-1openalex-snapshot
Undecidable problems in unreliable computations
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00867-8openalex-snapshot
Expired data collection in shared dataspaces
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00351-xopenalex-snapshot
A polynomial λ-bisimilar normalization for reset Petri nets
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80535-8openalex-snapshot
Monotonic Extensions of Petri Nets
inferred← citeshttps://doi.org/10.1023/a:1010914603293openalex-snapshot
Recursive Nested Petri Nets: Analysis of Semantic Properties and Expessibility
inferred← citeshttps://doi.org/10.1051/ita:2003001openalex-snapshot
About the decision of reachability for register machines
inferred← citeshttps://doi.org/10.1080/0952813x.2015.1080472openalex-snapshot
Classical workflow nets and workflow nets with reset arcs: using Lyapunov stability for soundness verification
inferred← citeshttps://doi.org/10.1093/comjnl/bxl074openalex-snapshot
Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Relaxed Soundness and Invariants
inferred← citeshttps://doi.org/10.1108/14637150910931479openalex-snapshot
Business process verification – finally a reality!
inferred← citeshttps://doi.org/10.1109/access.2016.2597061openalex-snapshot
A Branching-Process-Based Method to Check Soundness of Workflow Systems
inferred← citeshttps://doi.org/10.1109/access.2018.2878807openalex-snapshot
Modeling and Analysis for Mobile Computing Systems Based on Petri Nets: A Survey
inferred← citeshttps://doi.org/10.1109/access.2022.3180547openalex-snapshot
Middleware Control Systems Design and Analysis Using Message Interpreted Petri Nets (MIPN)
inferred← citeshttps://doi.org/10.1109/acsd.2012.26openalex-snapshot
An Algorithmic Framework for Coverability in Well-Structured Systems
inferred← citeshttps://doi.org/10.1109/icnc.2012.79openalex-snapshot
Decidability Analysis of Some Classes of Extended Function Petri Net
inferred← citeshttps://doi.org/10.1109/icnsc58704.2023.10319047openalex-snapshot
A Rewriting Logic Based Behaviour Semantics of Discrete event systems Models with Complex Dynamics
inferred← citeshttps://doi.org/10.1109/icsmc.2011.6083934openalex-snapshot
Robustness for protection envelopes with respect to human task variation
inferred← citeshttps://doi.org/10.1109/lics.1999.782630openalex-snapshot
On the verification of broadcast protocols
inferred← citeshttps://doi.org/10.1109/lics.2006.31openalex-snapshot
LTL with the Freeze Quantifier and Register Automata
inferred← citeshttps://doi.org/10.1109/lics.2012.46openalex-snapshot
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
inferred← citeshttps://doi.org/10.1109/lics.2017.8005065openalex-snapshot
Linear combinations of unordered data vectors
inferred← citeshttps://doi.org/10.1109/lics.2017.8005101openalex-snapshot
Polynomial automata: Zeroness and applications
inferred← citeshttps://doi.org/10.1109/sies.2016.7509430openalex-snapshot
Testing real-time embedded software using runtime enforcement
inferred← citeshttps://doi.org/10.1109/tase.2016.30openalex-snapshot
Termination and Boundedness for Well-Structured Pushdown Systems
inferred← citeshttps://doi.org/10.1109/tc.2004.66openalex-snapshot
Structural and dynamic changes in concurrent systems: reconfigurable Petri nets
inferred← citeshttps://doi.org/10.1109/tsmc.2021.3103072openalex-snapshot
Variable Petri Nets for Mobility
inferred← citeshttps://doi.org/10.1142/s0218843009002002openalex-snapshot
SYNCHRONIZATION AND CANCELATION IN WORKFLOWS BASED ON RESET NETS
inferred← citeshttps://doi.org/10.1145/1416729.1416775openalex-snapshot
Modelling collaborative workflows using recursive ECATNets
inferred← citeshttps://doi.org/10.1145/1507244.1507246openalex-snapshot
LTL with the freeze quantifier and register automata
inferred← citeshttps://doi.org/10.1145/2160910.2160915openalex-snapshot
Algorithmic verification of asynchronous programs
inferred← citeshttps://doi.org/10.1145/2603088.2603146openalex-snapshot
Hyper-Ackermannian bounds for pushdown vector addition systems
inferred← citeshttps://doi.org/10.1145/2629608openalex-snapshot
A Widening Approach to Multithreaded Program Verification
inferred← citeshttps://doi.org/10.1145/351268.351298openalex-snapshot
Solving coverability problems of petri nets by partial deduction
inferred← citeshttps://doi.org/10.1145/3614319openalex-snapshot
On Strongest Algebraic Program Invariants
inferred← citeshttps://doi.org/10.1145/3632872openalex-snapshot
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs
inferred← citeshttps://doi.org/10.1145/3661814.3662086openalex-snapshot
Soundness of reset workflow nets
inferred← citeshttps://doi.org/10.1145/3661814.3662133openalex-snapshot
Verifying Unboundedness via Amalgamation
inferred← citeshttps://doi.org/10.1155/2018/3193974openalex-snapshot
An SAT‐Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks
inferred← citeshttps://doi.org/10.1184/r1/6722915openalex-snapshot
Situational Awareness and Mixed Initiative Markup for Human-Robot Team Plans
inferred← citeshttps://doi.org/10.14393/ufu.te.2017.154openalex-snapshot
WorkFlow net possibilística aplicada aos sistemas de gerenciamento de processos de negócios flexíveis
inferred← citeshttps://doi.org/10.17638/03018108openalex-snapshot
Reachability games and related matrix and word problems
inferred← citeshttps://doi.org/10.18452/2448openalex-snapshot
Verteilte Geschäftsprozesse modellieren und analysieren
inferred← citeshttps://doi.org/10.18452/2454openalex-snapshot
12. Workshop "Algorithmen und Werkzeuge für Petrinetze" (AWPN 2005)
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:28)2012openalex-snapshot
Forward Analysis for WSTS, Part II: Complete WSTS
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:18)2013openalex-snapshot
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
inferred← citeshttps://doi.org/10.23638/lmcs-16(2:13)2020openalex-snapshot
Forward Analysis for WSTS, Part III: Karp-Miller Trees
inferred← citeshttps://doi.org/10.25405/ncl.34187109openalex-snapshot
A Polynomial Translation of Pi-calculus (FCP) to Safe Petri Nets
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25ccfopenalex-snapshot
Directed Reachability for Infinite-State Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cfeopenalex-snapshot
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
inferred← citeshttps://doi.org/10.3103/s0146411612070103openalex-snapshot
A simple algorithm for solving the coverability problem for monotonic counter systems
inferred← citeshttps://doi.org/10.3233/fi-2000-43123410openalex-snapshot
Nested Petri Nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems
inferred← citeshttps://doi.org/10.3233/fi-2009-0097openalex-snapshot
On the Expressiveness of Communication Channels for Object Nets
inferred← citeshttps://doi.org/10.3233/fi-2009-194openalex-snapshot
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
showing the first 200 of 242 · page through all 242
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.