Coding Mobile Synchronizing Petri Nets into Rewriting Logic

DOI10.1016/j.entcs.2006.10.021zbMath1277.68145DBLPjournals/entcs/Velardo07OpenAlexW2118185259WikidataQ57831230 ScholiaQ57831230MaRDI QIDQ2864520

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.2006.10.021

zbMATH Keywords

securityPetri netsrewritingspecificationsmobility

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Uses Software

• Maude

Cites Work

• Specification and verification of the tree identify protocol of IEEE 1394 in rewriting logic
• Using forward reachability analysis for verification of lossy channel systems
• Specification and proof in membership equational logic
• On the Expressiveness of Mobile Synchronizing Petri Nets
• Mobile Petri nets
• Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
• Petri Nets as Token Objects
• Foundations of Software Science and Computation Structures
• Recent Trends in Algebraic Development Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coding Mobile Synchronizing Petri Nets into Rewriting Logic