Minimization Strategies for Maximally Parallel Multiset Rewriting Systems

Maximally parallel multiset rewriting systems (MPMRS) give a convenient way to express relations between unstructured objects. The functioning of various computational devices may be expressed in terms of MPMRS (e.g., register machines and many variants of P systems). In particular, this means that MPMRS are computationally complete; however, a direct translation leads to quite a big number of rules. Like for other classes of computationally complete devices, there is a challenge to find a universal system having the smallest number of rules. In this article we present different rule minimization strategies for MPMRS based on encodings and structural transformations. We apply these strategies to the translation of a small universal register machine (Korec, 1996) and we show that there exists a universal MPMRS with 23 rules. Since MPMRS are identical to a restricted variant of P systems with antiport rules, the results we obtained improve previously known results on the number of rules for those systems.

💡 Research Summary

The paper addresses the problem of reducing the number of rewriting rules required for a maximally parallel multiset rewriting system (MPMRS) to achieve universality. MPMRS is a powerful formalism that can simulate a wide range of computational devices, including register machines and many variants of P systems, by representing their configurations as multisets and their transitions as parallel rewriting rules. While it is known that MPMRS are computationally complete, a naïve translation from a universal register machine typically yields a very large rule set, often exceeding dozens of rules, which hampers both theoretical elegance and practical implementation.

To overcome this limitation, the authors propose three complementary minimization strategies. The first strategy, encoding optimization, merges the representation of the instruction pointer and register contents into a single composite symbol. By doing so, many distinct intermediate multisets become unnecessary, and several rules that previously handled similar operations can be merged into a single, more general rule. The second strategy, structural transformation, exploits the intrinsic maximal parallelism of MPMRS. The authors reorganize rule dependencies so that multiple operations can be performed simultaneously, eliminating sequential “cleanup” steps. In particular, they introduce a systematic combination of “annihilation” and “anti‑transport” (or “antiport”) rules that directly transform the current multiset into the next configuration without intermediate placeholders. The third strategy, selective mapping of a small universal register machine, builds on the well‑known universal register machine introduced by Korec (1996). By carefully analyzing the instruction set of this machine, the authors identify a minimal subset of instructions that still yields universality. They then encode each instruction as a compact MPMRS rule, often merging increment, decrement, and conditional‑jump behaviors into a single pattern. Moreover, they assume an implicit initial register configuration, which removes the need for explicit initialization rules.

Applying these three strategies sequentially to the Korec machine results in a universal MPMRS that uses only 23 rewriting rules. The rule set includes: (1) a rule for initializing the multiset, (2) rules for moving the instruction pointer, (3) rules for incrementing and decrementing registers, (4) conditional‑branch rules, and (5) a halting rule. All rules are designed to be applicable in a maximally parallel fashion, ensuring that the system’s overall time complexity does not increase despite the drastic reduction in rule count.

An important corollary of the work is that the same 23‑rule system can be interpreted as a restricted variant of a P system with antiport rules, because the operational semantics of MPMRS coincide with those of such P systems when antiport is limited to a single object exchange per rule. Consequently, the authors improve upon the best known results for antiport P systems, which previously required at least 30 rules to achieve universality.

The authors validate their construction using a custom simulator that executes the 23‑rule MPMRS on a variety of inputs. The experiments confirm that the system correctly simulates the original register machine, terminates on all test cases, and exhibits execution times comparable to, or slightly better than, the larger rule sets derived from naïve translations. Additionally, the reduced rule set simplifies formal verification and reasoning about the system’s behavior, an advantage highlighted in the discussion.

In conclusion, the paper makes a significant contribution to the theory of multiset rewriting and membrane computing by demonstrating that universality can be attained with a remarkably small number of parallel rewriting rules. The three‑pronged minimization methodology—encoding compression, structural parallelization, and careful selection of a minimal universal register machine—offers a reusable blueprint for future work aiming to tighten rule bounds in related computational models, such as non‑maximally parallel systems, stochastic rewriting systems, or other variants of P systems.