On the Expressiveness of Mobile Synchronizing Petri Nets

DOI10.1016/j.entcs.2005.05.048zbMath1277.68205OpenAlexW2130026737WikidataQ57831232 ScholiaQ57831232MaRDI QIDQ2864393

Olga Marroquín Alonso, David de Frutos-Escrig, Fernando Rosa-Velardo

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.05.048

zbMATH Keywords

securityPetri netsexpressivenessmobility

Mathematics Subject Classification ID

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

Related Items (5)

Aligning event logs to resource-constrained \(\nu \)-Petri nets ⋮ Ordinal recursive complexity of unordered data nets ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication ⋮ Coding Mobile Synchronizing Petri Nets into Rewriting Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic analysis of programs with well quasi-ordered domains.
• Replicated Ubiquitous Nets
• Foundations of Software Science and Computation Structures

This page was built for publication: On the Expressiveness of Mobile Synchronizing Petri Nets