Turning SOS rules into equations
Information and Computation
Formal verification of parallel programs
Communications of the ACM
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
A comparison of Statecharts step semantics
Theoretical Computer Science
A Compositional Semantics for Statecharts using Labeled Transition Systems
CONCUR '94 Proceedings of the Concurrency Theory
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
CONCUR '94 Proceedings of the Concurrency Theory
Full Abstraction in Structural Operational Semantics (Extended Abstract)
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
An axiomatic semantics for the synchronous language Gentzen
Journal of Computer and System Sciences
Using well-structured transition systems to decide divergence for catalytic P systems
Theoretical Computer Science
A rewriting logic framework for operational semantics of membrane systems
Theoretical Computer Science
WMC'07 Proceedings of the 8th international conference on Membrane computing
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Structural operational semantics of p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Natural Computing: an international journal
Formal verification and testing based on p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Modeling dependencies and simultaneity in membrane system computations
Theoretical Computer Science
Foundational aspects of multiscale modeling of biological systems with process algebras
Theoretical Computer Science
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
An Algorithm for the Identification of Components in Biochemical Pathways
Electronic Notes in Theoretical Computer Science (ENTCS)
Simulation of Spatial P system models
Theoretical Computer Science
| Hi-index | 5.23 |
The aim of the paper is to give a compositional semantics in the style of the Structural Operational Semantics (SOS) and to study behavioral equivalence notions for P Systems. Firstly, we consider P Systems with maximal parallelism and without priorities. We define a process algebra, called P Algebra, whose terms model membranes, we equip the algebra with a Labeled Transition System (LTS) obtained through SOS transition rules, and we study how some equivalence notions defined over the LTS model apply in our case. Then, we consider P Systems with priorities and extend the introduced framework to deal with them. We prove that our compositional semantics reflects correctly maximal parallelism and priorities.