Declarative event based models of concurrency and refinement in psi-calculi

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Declarative event based models of concurrency and refinement in psi-calculi. / Normann, Håkon; Johansen, Christian; Hildebrandt, Thomas.

In: Journal of Logic and Algebraic Programming, Vol. 85, No. 3, 2015, p. 368-398.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Normann, H, Johansen, C & Hildebrandt, T 2015, 'Declarative event based models of concurrency and refinement in psi-calculi', Journal of Logic and Algebraic Programming, vol. 85, no. 3, pp. 368-398. https://doi.org/10.1016/j.jlamp.2015.12.007

APA

Normann, H., Johansen, C., & Hildebrandt, T. (2015). Declarative event based models of concurrency and refinement in psi-calculi. Journal of Logic and Algebraic Programming, 85(3), 368-398. https://doi.org/10.1016/j.jlamp.2015.12.007

Vancouver

Normann H, Johansen C, Hildebrandt T. Declarative event based models of concurrency and refinement in psi-calculi. Journal of Logic and Algebraic Programming. 2015;85(3):368-398. https://doi.org/10.1016/j.jlamp.2015.12.007

Author

Normann, Håkon ; Johansen, Christian ; Hildebrandt, Thomas. / Declarative event based models of concurrency and refinement in psi-calculi. In: Journal of Logic and Algebraic Programming. 2015 ; Vol. 85, No. 3. pp. 368-398.

Bibtex

@article{87feb25dfdfb4c56944ed7e2479bc7fe,
title = "Declarative event based models of concurrency and refinement in psi-calculi",
abstract = "Psi-calculi constitute a parametric framework for nominal process calculi, where constraint based process calculi and process calculi for mobility can be defined as instances. We apply here the framework of psi-calculi to provide a foundation for the exploration of declarative event-based process calculi with support for run-time refinement. We first provide a representation of the model of finite prime event structures as an instance of psi-calculi and prove that the representation respects the semantics up to concurrency diamonds and action refinement. We then proceed to give a psi-calculi representation of Dynamic Condition Response Graphs, which conservatively extends prime event structures to allow finite representations of (omega) regular finite (and infinite) behaviours and have been shown to support run-time adaptation and refinement. We end by outlining the final aim of this research, which is to explore nominal calculi for declarative, run-time adaptable mobile processes with shared resources.",
author = "H{\aa}kon Normann and Christian Johansen and Thomas Hildebrandt",
year = "2015",
doi = "10.1016/j.jlamp.2015.12.007",
language = "English",
volume = "85",
pages = "368--398",
journal = "Journal of Logic and Algebraic Programming",
issn = "2352-2208",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

T1 - Declarative event based models of concurrency and refinement in psi-calculi

AU - Normann, Håkon

AU - Johansen, Christian

AU - Hildebrandt, Thomas

PY - 2015

Y1 - 2015

N2 - Psi-calculi constitute a parametric framework for nominal process calculi, where constraint based process calculi and process calculi for mobility can be defined as instances. We apply here the framework of psi-calculi to provide a foundation for the exploration of declarative event-based process calculi with support for run-time refinement. We first provide a representation of the model of finite prime event structures as an instance of psi-calculi and prove that the representation respects the semantics up to concurrency diamonds and action refinement. We then proceed to give a psi-calculi representation of Dynamic Condition Response Graphs, which conservatively extends prime event structures to allow finite representations of (omega) regular finite (and infinite) behaviours and have been shown to support run-time adaptation and refinement. We end by outlining the final aim of this research, which is to explore nominal calculi for declarative, run-time adaptable mobile processes with shared resources.

AB - Psi-calculi constitute a parametric framework for nominal process calculi, where constraint based process calculi and process calculi for mobility can be defined as instances. We apply here the framework of psi-calculi to provide a foundation for the exploration of declarative event-based process calculi with support for run-time refinement. We first provide a representation of the model of finite prime event structures as an instance of psi-calculi and prove that the representation respects the semantics up to concurrency diamonds and action refinement. We then proceed to give a psi-calculi representation of Dynamic Condition Response Graphs, which conservatively extends prime event structures to allow finite representations of (omega) regular finite (and infinite) behaviours and have been shown to support run-time adaptation and refinement. We end by outlining the final aim of this research, which is to explore nominal calculi for declarative, run-time adaptable mobile processes with shared resources.

U2 - 10.1016/j.jlamp.2015.12.007

DO - 10.1016/j.jlamp.2015.12.007

M3 - Journal article

VL - 85

SP - 368

EP - 398

JO - Journal of Logic and Algebraic Programming

JF - Journal of Logic and Algebraic Programming

SN - 2352-2208

IS - 3

ER -

ID: 227990392