A timed mobility semantics based on rewriting strategies

Authors:
Gabriel Ciobanu;Maciej Koutny;Jason Steggles
Affiliations:
Faculty of Computer Science, A.I. Cuza University of Iasi, Iasi, Romania;School of Computing Science, University of Newcastle, U.K.;School of Computing Science, University of Newcastle, U.K.
Venue:
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Year:
2012

Citing 14
Cited 0

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Universal algebra

Handbook of logic in computer science (vol. 1)
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Absolute versus relative time in process algebras

Information and Computation - Special issue on EXPRESS 1997
Mobile ambients

Theoretical Computer Science
ELAN from a rewriting logic point of view

Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Stratego: A Language for Program Transformation Based on Rewriting Strategies

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
A Rewriting Implementation of pi-calculus

A Rewriting Implementation of pi-calculus
A Distributed Pi-Calculus

A Distributed Pi-Calculus
Mobile ambients with timers and types

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Tom: piggybacking rewriting on java

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Modelling and verification of timed interaction and migration

FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Timed migration and interaction with access permissions

FM'11 Proceedings of the 17th international conference on Formal methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider TiMo (Timed Mobility) which is a process algebra for prototyping software engineering applications supporting mobility and timing constraints. We provide an alternative semantics of TiMo using rewriting logic; in particular, we develop a rewriting logic model based on strategies to describe a maximal parallel computational step of a TiMo specification. This new semantical model is proved to be sound and complete w.r.t. to the original operational semantics which was based on negative premises. We implement the rewriting model within the strategy-based rewriting system Elan, and provide an example illustrating how a TiMo specification is executed and how a range of (behavioural) properties are analysed.