Repositorio de producción científica de la Universidad de Sevilla

Verifying P Systems with Costs by Using Priced-Timed Maude

 

Advanced Search
 
Opened Access Verifying P Systems with Costs by Using Priced-Timed Maude
Cites
Show item statistics
Icon
Export to
Author: Aman, Bogdan
Ciobanu, Gabriel
Date: 2016
Published in: BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, February 1-5 (2016), p 85-96
Document type: Presentation
Abstract: We consider P systems that assigns storage costs per step to membranes, and execution costs to rules. We present an abstract syntax of the new class of membrane systems, and then deal with costs by extending the operational semantics of P systems with promoters, inhibitors and registers.We use Priced-Timed Maude to implement the P systems with costs. By using such a rewriting engine which corresponds to the semantics of membrane systems with costs, we are able to prove the operational correctness of this implementation. Based on such an operational correspondence, we can analyze properly the evolutions of the P systems with costs, and verify several reachability properties, including the cost of computations that reach a given membrane con guration. This approach opens the way to various optimization problems related to membrane systems, problems making sense in a bio-inspired model which now can be veri ed by using a complex software platform.
Cite: Aman, B. y Ciobanu, G. (2016). Verifying P Systems with Costs by Using Priced-Timed Maude. En BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, February 1-5 (85-96), Sevilla: Fénix.
Size: 267.4Kb
Format: PDF

URI: http://hdl.handle.net/11441/49283

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)