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

DOI10.1142/S0129054109006644zbMATH Open1207.68177MaRDI QIDQ3636151FDOQ3636151

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)

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
• Term Rewriting and All That
• Models and logics for true concurrency.

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)