Model Checking Reconfigurable Petri Nets with Maude

A Maude Implementation of Rewritable Petri Nets: a Feasible Model for Dynamically Reconfigurable Systems

“…Differently from [20,17], bags on a set are not merely represented as the free commutative monoid on that set. Despite its elegance and simplicity, such a formalization is unsuitable for bags with many repetitions.…”

“…The remaining part of the module contains a (possibly empty) set R of rewrite rules specifying structural/state changes that may occur during the evolution of the system initially matched by the value of term net m0. With respect to similar approaches [17], where rewrite rules strictly follow, both syntactically and semantically, the paradigm of algebraic GTS (based, e.g., on DPO rules) and require quite complex consistency checks (e.g., to verify the respect of gluing conditions), our Maude-based specification fosters a much more flexible, free-style, though rigorous, formalization of (rule-based) system transformations.…”

“…We focus on operational, modelling aspects, by proposing an expressive and efficient framework for the specification/analysis of (automated) distributed systems with reconfiguration capability. With respect to similar approaches [2,17], in which (reconfigurable) PN classes are converted in Maude modules to exploit the model-checking tools of Maude, our encoding provides more data abstraction to ease the modeller task, is more compact and efficient, and promotes the definition of rewrite rules with a higher level of flexibility. Throughout the paper, we use as a benchmark a simple, yet tricky, model of faulttolerant Manufacturing System.…”

Graph Transformation

“…For most of these efforts, 'synthesis' refers to the process of automatically generating executable code from information given in some higher level form: Examples include the generation of code that manipulates many different artifacts (e.g., bitvectors [70], concurrent data structures [69], database queries [9], data reprentations [68], or spreadsheets [26]), gives feedback to students for programming assignments [68], or implements an optimizing compiler [8]. For most of these efforts, 'synthesis' refers to the process of automatically generating executable code from information given in some higher level form: Examples include the generation of code that manipulates many different artifacts (e.g., bitvectors [70], concurrent data structures [69], database queries [9], data reprentations [68], or spreadsheets [26]), gives feedback to students for programming assignments [68], or implements an optimizing compiler [8].…”

A Non-Deterministic Multiset Query Language

“…Conditional term rewriting [10] was proposed as an alternative (if less popular) generic framework for specification of dynamic systems [11]. It subsumes a variety of Petri nets [12] and their simulation is one of popular applications of the term rewriting system Maude [13,14]). More precisely, it is well known (see e.g., [12]) that coloured Petri nets can be implemented by multiset rewriting systems, and, conversely, rewriting systems which rewrite multisets of terms representing colour tokens can be interpreted as Petri nets: just identify places with colour tokens, and each rewriting rule of the form a 1 a 2 .…”