Pages that link to "Item:Q554219"
From MaRDI portal
The following pages link to Decidability and complexity of Petri nets with unordered data (Q554219):
Displaying 16 items.
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Data and process resonance. Identifier soundness for models of information systems (Q2165251) (← links)
- Continuous reachability for unordered data Petri nets is in PTime (Q2289079) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- (Q5009439) (← links)
- Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions (Q5025032) (← links)
- SMT-based verification of data-aware processes: a model-theoretic approach (Q5139282) (← links)
- Dynamic Networks of Timed Petri Nets (Q5166770) (← links)
- A Non-Deterministic Multiset Query Language (Q5862341) (← links)
- WQO dichotomy for 3-graphs (Q5919047) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
- Correctness Notions for Petri Nets with Identifiers (Q6189321) (← links)
