Coding mobile synchronizing Petri nets into rewriting logic
DOI10.1016/J.ENTCS.2006.10.021zbMATH Open1277.68145DBLPjournals/entcs/Velardo07OpenAlexW2118185259WikidataQ57831230 ScholiaQ57831230MaRDI QIDQ2864520FDOQ2864520
Authors: 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
Recommendations
Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Using forward reachability analysis for verification of lossy channel systems
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
- Title not available (Why is that?)
- Specification and proof in membership equational logic
- Title not available (Why is that?)
- On the expressiveness of mobile synchronizing Petri nets
- Petri Nets as Token Objects
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
- Specification and verification of the tree identify protocol of IEEE 1394 in rewriting logic
- Mobile Petri nets
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- Nested Petri nets: Multi-level and recursive systems.
- Recent Trends in Algebraic Development Techniques
Cited In (3)
Uses Software
This page was built for publication: Coding mobile synchronizing Petri nets into rewriting logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864520)
