Beta-binders is a recent process algebra developed for modeling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. The proof of the decidability of this congruence, reported in this paper, is a first step towards implementations. Published in TCS 404(1-2):156-169, c2008 Elsevier, available at http://dx.doi.org/10.1016/j.tcs.2008.04.007
On the Decidability and Complexity of the Structural Congruence for Beta-binders / Priami, Corrado; Romanel, Alessandro. - ELETTRONICO. - (2006), pp. 1-27.
On the Decidability and Complexity of the Structural Congruence for Beta-binders
Priami, Corrado;Romanel, Alessandro
2006-01-01
Abstract
Beta-binders is a recent process algebra developed for modeling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. The proof of the decidability of this congruence, reported in this paper, is a first step towards implementations. Published in TCS 404(1-2):156-169, c2008 Elsevier, available at http://dx.doi.org/10.1016/j.tcs.2008.04.007| File | Dimensione | Formato | |
|---|---|---|---|
|
TR-06-2006.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
413.69 kB
Formato
Adobe PDF
|
413.69 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
