Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions
Publication:5170164
DOI10.1016/j.entcs.2009.03.038zbMath1294.68081OpenAlexW1975142301MaRDI QIDQ5170164
Publication date: 22 July 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.03.038
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- A rewriting logic framework for operational semantics of membrane systems
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Membrane computing. An introduction.
- Specification and proof in membership equational logic
- Semantic foundations for generalized rewrite theories
- Expressing Control Mechanisms of Membranes by Rewriting Strategies
- Algebraic laws for nondeterminism and concurrency
- Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
- Strategy-Based Proof Calculus for Membrane Systems
- Models and logics for true concurrency.
- Rewriting logic as a semantic framework for concurrency: a progress report
This page was built for publication: Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions