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

DOI10.1016/j.tcs.2024.114397OpenAlexW4390941873WikidataQ129754599 ScholiaQ129754599MaRDI QIDQ6120343

Lorenzo Capra, Michael Köhler-Bußmeier

Publication date: 20 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114397

zbMATH Keywords

distributed systemsmodel-checkingadaptation\texttt{Maude}PT nets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A calculus of mobile processes. I
• A symbolic reachability graph for coloured Petri nets
• Mobile ambients
• Overview of reconfigurable Petri nets
• Specification and proof in membership equational logic
• On primitives for compensation handling as adaptable processes
• Formal specification and verification of decentralized self-adaptive systems using symmetric nets
• Practical graph isomorphism. II.
• An SMT-Based Approach to Coverability Analysis
• Conflict Propagation and Component Recursion for Canonical Labeling
• 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
• Process algebra for synchronous communication
• Exact and ordinary lumpability in finite Markov chains
• Adaptable processes
• Complexity Results for Elementary Hornets
• Graph isomorphism in quasipolynomial time [extended abstract]
• On the Complexity of the Reachability Problem for Safe, Elementary Hornets
• A Survey of Decidability Results for Elementary Object Systems
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Applications and Theory of Petri Nets 2005
• Canonization of reconfigurable PT nets in \texttt{Maude}

This page was built for publication: Modular rewritable Petri nets: an efficient model for dynamic distributed systems