Nets with Tokens Which Carry Data

DOI10.1007/978-3-540-73094-1_19MaRDI QIDQ3612940zbMATH OpenOpenAlexFDO

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

Publication date 11 March 2009

Published in Petri Nets and Other Models of Concurrency – ICATPN 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73094-1_19

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
• On the coverability and reachability languages of monotonic extensions of Petri nets
• Petri nets with structured data

Cited in

(15)

• A classification of the expressive power of well-structured transition systems
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• Petri nets with structured data
• The meaning of frozen tokens in live nets
• Coverability trees for Petri nets with unordered data
• WQO dichotomy for 3-graphs
• Petri nets with structured data
• WQO dichotomy for 3-graphs
• Nets with tokens which carry data
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Well structured transition systems with history
• Undecidability of performance equivalence of Petri nets
• The ω-Regular Post Embedding Problem
• What makes Petri nets harder to verify: stack or data?
• Ordinal recursive complexity of unordered data nets

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 Q3612940)