REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY

DOI10.1142/S0129054109006644zbMATH Open1207.68177MaRDI QIDQ3636151FDOQ3636151

Authors Dorel Lucanu

Publication date 30 June 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

membrane computingP systemsmaximal concurrencyRewriting logic

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions
• Operational semantics and rewriting logic in membrane computing
• A rewriting logic framework for operational semantics of membrane systems
• Rewriting logic specification of membrane systems with promoters and inhibitors
• Conditional rewriting logic as a unified model of concurrency

Cites work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Handbook of Graph Theory
• Models and logics for true concurrency.
• Term Rewriting and All That

Cited in

(5)

• scientific article; zbMATH DE number 2043548 (Why is no real title available?)
• Operational semantics and rewriting logic in membrane computing
• Maximally parallel probabilistic semantics for multiset rewriting
• Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions
• scientific article; zbMATH DE number 6694449 (Why is no real title available?)

Describes a project that uses

Uses Software

• Maude

This page was built for publication: REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636151)