Canonization of reconfigurable PT nets in \texttt{Maude}

DOI10.1007/978-3-031-19135-0_11OpenAlexW4312741652MaRDI QIDQ6173110

Lorenzo 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)

Related Items (1)

Modular rewritable Petri nets: an efficient model for dynamic distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Conditional rewriting logic as a unified model of concurrency
• Overview of reconfigurable Petri nets
• Specification and proof in membership equational logic
• Formal specification and verification of decentralized self-adaptive systems using symmetric nets
• Model Checking Reconfigurable Petri Nets with Maude
• Transformations in Reconfigurable Place/Transition Systems
• Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems
• Hornets: Nets within Nets Combined with Net Algebra
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2005
• Applications and Theory of Petri Nets 2005

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