Rewriting Logic Semantics of P Systems

[...home [...implementation] [...@ [...1] [...2] [...3] ] ]

Examples

In this section we consider two examples of P systems, and then describe and execute their Maude specification. The first one non-deterministically generates numbers of the form for n > 0, while the second one computes for a given n.
  1. Generating numbers of the form n² using the accurate or the faithful implementation
  2. Computing n² using the accurate implementation