Model Checking Reconfigurable Petri Nets with Maude

DOI10.1007/978-3-319-40530-8_4zbMath1344.68141OpenAlexW2498717329MaRDI QIDQ3187803

Alexander Schulz, Julia Padberg

Publication date: 5 September 2016

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40530-8_4

zbMATH Keywords

model checkingfield programmable gate arrayMaudereconfigurable Petri netsdynamic partial reconfigurationrewrite logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (5)

Model Checking Reconfigurable Petri Nets with Maude ⋮ Modular rewritable Petri nets: an efficient model for dynamic distributed systems ⋮ Canonization of reconfigurable PT nets in \texttt{Maude} ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ A Non-Deterministic Multiset Query Language

Uses Software

• SPIN

Cites Work

• Model Checking Reconfigurable Petri Nets with Maude
• Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems
• A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
• Lectures on Concurrency and Petri Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model Checking Reconfigurable Petri Nets with Maude