Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS combines a set of entities with a set of reactions over them. Entities can be provided by an external context, used to enable or inhibit each reaction, and also produced by reactions.RS semantics is defined in terms of an (unlabelled) rewrite system: given the current set of entities, a rewrite step consists of the application of all and only the enabled reactions. In this paper we define, for the first time, a compositional labelled transition system for RSs with recursive and nondeterministic contexts, in the structural operational semantics (SOS) style. This is achieved by distilling a signature whose operators directly correspond to the ingredients of RSs and by defining some simple SOS inference rules for any such operator. The rich information recorded in the labels allows us to define an assertion language to tailor behavioural equivalences on some specific properties or entities.The SOS approach is suited to drive additional enhancements of RSs along features such as quantitative measurements of entities and communication between RSs. The SOS rules have been also exploited to design a prototype implementation in logic programming.

Brodo, L., Bruni, R., & Falaschi, M. (2021). SOS Rules for Equivalences of Reaction Systems. In Functional and Constraint Logic Programming, WFLP 2020 (pp.3-21). Cham : Springer [10.1007/978-3-030-75333-7_1].

SOS Rules for Equivalences of Reaction Systems

Falaschi, Moreno
2021

Abstract

Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS combines a set of entities with a set of reactions over them. Entities can be provided by an external context, used to enable or inhibit each reaction, and also produced by reactions.RS semantics is defined in terms of an (unlabelled) rewrite system: given the current set of entities, a rewrite step consists of the application of all and only the enabled reactions. In this paper we define, for the first time, a compositional labelled transition system for RSs with recursive and nondeterministic contexts, in the structural operational semantics (SOS) style. This is achieved by distilling a signature whose operators directly correspond to the ingredients of RSs and by defining some simple SOS inference rules for any such operator. The rich information recorded in the labels allows us to define an assertion language to tailor behavioural equivalences on some specific properties or entities.The SOS approach is suited to drive additional enhancements of RSs along features such as quantitative measurements of entities and communication between RSs. The SOS rules have been also exploited to design a prototype implementation in logic programming.
978-303075332-0
Brodo, L., Bruni, R., & Falaschi, M. (2021). SOS Rules for Equivalences of Reaction Systems. In Functional and Constraint Logic Programming, WFLP 2020 (pp.3-21). Cham : Springer [10.1007/978-3-030-75333-7_1].
File in questo prodotto:
File Dimensione Formato  
2008.13016.pdf

non disponibili

Tipologia: Pre-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 258.39 kB
Formato Adobe PDF
258.39 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Brodo2021_Chapter_SOSRulesForEquivalencesOfReact.pdf

non disponibili

Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 502.1 kB
Formato Adobe PDF
502.1 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11365/1124712