Canonization of reconfigurable PT nets in \texttt{Maude}

DOI10.1007/978-3-031-19135-0_11MaRDI QIDQ6173110zbMATH OpenOpenAlexFDO

Authors L. Capra

Publication date 21 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-19135-0_11

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Applications and Theory of Petri Nets 2005
• Applications and Theory of Petri Nets 2005
• Conditional rewriting logic as a unified model of concurrency
• Formal specification and verification of decentralized self-adaptive systems using symmetric nets
• Hornets: Nets within Nets Combined with Net Algebra
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 1973125 (Why is no real title available?)
• scientific article; zbMATH DE number 2038715 (Why is no real title available?)
• Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems
• Lectures on Concurrency and Petri Nets
• Model checking reconfigurable Petri nets with Maude
• Overview of reconfigurable Petri nets
• Specification and proof in membership equational logic
• Transformations in Reconfigurable Place/Transition Systems

Cited in

(3)

• Modular rewritable Petri nets: an efficient model for dynamic distributed systems
• Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
• A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets

This page was built for publication: Canonization of reconfigurable PT nets in \texttt{Maude}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173110)