Decidability and complexity of Petri nets with unordered data
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Decidability problems in Petri nets with names and replication
- Coverability trees for Petri nets with unordered data
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- Accelerations for the coverability set of Petri nets with names
- Nets with tokens which carry data
Cites work
- A calculus of mobile processes. I
- A classification of the expressive power of well-structured transition systems
- Algorithmic analysis of programs with well quasi-ordered domains.
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Constraint-based automatic verification of abstract models of multithreaded programs
- Cost soundness for priced resource-constrained workflow nets
- Decidability problems in Petri nets with names and replication
- Decidability problems of a basic class of object nets
- Forward analysis for Petri nets with name creation
- Forward Analysis for WSTS, Part II: Complete WSTS
- Forward analysis for WSTS. I: Completions
- scientific article; zbMATH DE number 5506900 (Why is no real title available?)
- scientific article; zbMATH DE number 3914378 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1302043 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 1515290 (Why is no real title available?)
- scientific article; zbMATH DE number 1522994 (Why is no real title available?)
- scientific article; zbMATH DE number 1884408 (Why is no real title available?)
- scientific article; zbMATH DE number 1405652 (Why is no real title available?)
- Instance Deadlock: A Mystery behind Frozen Programs
- Mobile ambients
- Nets with tokens which carry data
- On the expressiveness of communication channels for object nets
- On the expressiveness of mobile synchronizing Petri nets
- Petri Nets as Token Objects
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- The reachability problem for object nets
- Well-structured transition systems everywhere!
Cited in
(36)- The emptiness problem for valence automata or: another decidable extension of Petri nets
- Data and process resonance. Identifier soundness for models of information systems
- Continuous reachability for unordered data Petri nets is in PTime
- Petri nets with name creation for transient secure association
- Coverability trees for Petri nets with unordered data
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- A theory of name boundedness
- Undecidability of coverability and boundedness for timed-arc Petri nets with invariants
- The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
- Decidability problems in Petri nets with names and replication
- Model checking Petri nets with names using data-centric dynamic systems
- Accelerations for the coverability set of Petri nets with names
- Forward analysis for Petri nets with name creation
- Replicated Ubiquitous Nets
- Nets with tokens which carry data
- Nets with Tokens Which Carry Data
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- The complexity of coverability in -Petri nets
- Petri nets with structured data
- Linear equations with ordered data
- Soundness verification of data-aware process models with variable-to-variable conditions
- SMT-based verification of data-aware processes: a model-theoretic approach
- Dynamic networks of timed Petri nets
- Ordinal recursive complexity of unordered data nets
- A Non-Deterministic Multiset Query Language
- WQO dichotomy for 3-graphs
- WQO dichotomy for 3-graphs
- The ideal view on Rackoff's coverability technique
- From DB-nets to Coloured Petri Nets with Priorities
- Correctness Notions for Petri Nets with Identifiers
- Bi-reachability in Petri nets with data
- Verification of population protocols with unordered data
- Flattability of priority vector addition systems
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication: Decidability and complexity of Petri nets with unordered data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554219)
