Nets with tokens which carry data

MaRDI QIDQ3601861zbMATH OpenFDO

Authors Ranko Lazić, Tom Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell

Publication date 12 February 2009

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Nets with Tokens Which Carry Data
• Coverability trees for Petri nets with unordered data
• Decidability and complexity of Petri nets with unordered data
• scientific article; zbMATH DE number 4035157
• Petri nets with structured data

Cited in

(34)

• The meaning of frozen tokens in live nets
• What makes Petri nets harder to verify: stack or data?
• On termination and invariance for faulty channel machines
• Looking at mean-payoff and total-payoff through windows
• Coverability trees for Petri nets with unordered data
• Complexity hierarchies beyond elementary
• Petri nets with structured data
• Model checking Petri nets with names using data-centric dynamic systems
• On the Verification of Timed Ad Hoc Networks
• The ideal approach to computing closed subsets in well-quasi-orderings
• Forward analysis for WSTS, part I: completions
• Replicated Ubiquitous Nets
• Nets with Tokens Which Carry Data
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• Petri nets with structured data
• Linear equations with ordered data
• Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
• Data centric workflows for crowdsourcing
• SMT-based verification of data-aware processes: a model-theoretic approach
• Dynamic networks of timed Petri nets
• Ordinal recursive complexity of unordered data nets
• Decidability and complexity of Petri nets with unordered data
• WQO dichotomy for 3-graphs
• Fast computations on ordered nominal sets
• WQO dichotomy for 3-graphs
• The ideal view on Rackoff's coverability technique
• Parameterized broadcast networks with registers: from NP to the frontiers of decidability
• Solvability of orbit-finite systems of linear equations
• Orbit-finite linear programming
• Multiset rewriting for the verification of depth-bounded processes with name binding
• Nets-within-nets through the lens of data nets
• On the reachability problem for two-dimensional branching VASS
• Bridging the gap between plain VASS and branching VASS
• Parameterized verification of time-sensitive models of ad hoc network protocols

This page was built for publication: Nets with tokens which carry data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601861)