Defining and Executing P Systems with Structured Data in K

DOI10.1007/978-3-540-95885-7_26zbMath1196.68084OpenAlexW1490868210MaRDI QIDQ5191176

Traian-Florin Şerbănuţă, Gheorghe Ştefănescu, Grigore Roşu

Publication date: 28 July 2009

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95885-7_26

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items

From Rewriting Logic, to Programming Language Semantics, to Program Verification ⋮ A formal library of set relations and its application to synchronous languages ⋮ \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages ⋮ P systems with control nuclei: the concept ⋮ An overview of the K semantic framework ⋮ Simulation and Verification of Synchronous Set Relations in Rewriting Logic

Uses Software

• ML
• Maude
• K Prover
• KOOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of communication: P systems with symport/antiport
• A rewriting logic framework for operational semantics of membrane systems
• Conditional rewriting logic as a unified model of concurrency
• The chemical abstract machine
• A theory of type polymorphism in programming
• Computing with membranes
• Maude: specification and programming in rewriting logic
• The conformon-P system: a molecular and cell biology-inspired computability model
• P transducers
• A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters
• Expressing Control Mechanisms of Membranes by Rewriting Strategies
• Brane Calculi
• Membrane Computing