Strategy based semantics for mobility with time and access permissions
Gespeichert in:
Verfasser / Beitragende:
[Gabriel Ciobanu, Maciej Koutny, Jason Steggles]
Ort, Verlag, Jahr:
2015
Enthalten in:
Formal Aspects of Computing, 27/3(2015-05-01), 525-549
Format:
Artikel (online)
Online Zugang:
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605516200 | ||
| 003 | CHVBK | ||
| 005 | 20210128100713.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150501xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00165-014-0324-9 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00165-014-0324-9 | ||
| 245 | 0 | 0 | |a Strategy based semantics for mobility with time and access permissions |h [Elektronische Daten] |c [Gabriel Ciobanu, Maciej Koutny, Jason Steggles] |
| 520 | 3 | |a The process algebras Timed Mobility (TiMo) and its extension Permissions, Timers and Mobility (PerTiMo) were recently proposed to support engineering applications in distributed system design. TiMo provides a formal framework in which process migration between distinct locations and timing constraints linked to local clocks can be modelled and analysed. This is extended in PerTiMo by associating access permissions to communication to model security aspects of a distributed system. In this paper we develop a new semantic model for TiMo using Rewriting Logic (RL) and strategies, with the aim of providing a foundation for tool support; in particular, strategies are used to capture the locally maximal concurrent step of a TiMo specification which previously required the use of action rules based on negative premises. This RL model is then extended with access permissions in order to develop a new semantic model for PerTiMo. These RL semantical models are formally proved to be sound and complete with respect to the original operational semantics on which they were based. We present examples of how the developed RL models for TiMo and PerTiMo can be implemented within the strategy-based rewriting system Elan and illustrate the range of (behavioural) properties that can be analysed using such a tool. | |
| 540 | |a British Computer Society, 2014 | ||
| 690 | 7 | |a Process algebra |2 nationallicence | |
| 690 | 7 | |a Mobility |2 nationallicence | |
| 690 | 7 | |a Time |2 nationallicence | |
| 690 | 7 | |a Access permissions |2 nationallicence | |
| 690 | 7 | |a Rewriting Logic |2 nationallicence | |
| 690 | 7 | |a Strategies |2 nationallicence | |
| 700 | 1 | |a Ciobanu |D Gabriel |u Romanian Academy, Institute of Computer Science, Iaşi, Romania |4 aut | |
| 700 | 1 | |a Koutny |D Maciej |u School of Computing Science, University of Newcastle, Newcastle, UK |4 aut | |
| 700 | 1 | |a Steggles |D Jason |u School of Computing Science, University of Newcastle, Newcastle, UK |4 aut | |
| 773 | 0 | |t Formal Aspects of Computing |d Springer London |g 27/3(2015-05-01), 525-549 |x 0934-5043 |q 27:3<525 |1 2015 |2 27 |o 165 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00165-014-0324-9 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00165-014-0324-9 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ciobanu |D Gabriel |u Romanian Academy, Institute of Computer Science, Iaşi, Romania |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Koutny |D Maciej |u School of Computing Science, University of Newcastle, Newcastle, UK |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Steggles |D Jason |u School of Computing Science, University of Newcastle, Newcastle, UK |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Formal Aspects of Computing |d Springer London |g 27/3(2015-05-01), 525-549 |x 0934-5043 |q 27:3<525 |1 2015 |2 27 |o 165 | ||