Coding mobile synchronizing Petri nets into rewriting logic
From MaRDI portal
Publication:2864520
Recommendations
Cites work
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- scientific article; zbMATH DE number 1049168 (Why is no real title available?)
- scientific article; zbMATH DE number 1973125 (Why is no real title available?)
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
- Foundations of Software Science and Computation Structures
- Mobile Petri nets
- Nested Petri nets: Multi-level and recursive systems.
- On the expressiveness of mobile synchronizing Petri nets
- Petri Nets as Token Objects
- Recent Trends in Algebraic Development Techniques
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- Specification and proof in membership equational logic
- Specification and verification of the tree identify protocol of IEEE 1394 in rewriting logic
- Using forward reachability analysis for verification of lossy channel systems
Cited in
(3)
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)