A Timed Mobility Semantics Based on Rewriting Strategies

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.

[1]  Gabriel Ciobanu,et al.  Timed Migration and Interaction with Access Permissions , 2011, FM.

[2]  Wolfram Schulte,et al.  FM 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings , 2011, FM.

[3]  Gabriel Ciobanu,et al.  Timed Mobility in process algebra and Petri nets , 2011, J. Log. Algebraic Methods Program..

[4]  Karl Meinke,et al.  Universal algebra , 1993, LICS 1993.

[5]  Pierre-Etienne Moreau,et al.  Tom: Piggybacking Rewriting on Java , 2007, RTA.

[6]  Salma Jamoussi,et al.  Handling ELAN rewrite programs via an exchange format , 1998, WRLA.

[7]  Martin Berger.  Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi , 2004, CONCUR.

[8]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[9]  P. Viry.  A Rewriting Implementation of pi-calculus , 1996 .

[10]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[11]  Claude Kirchner,et al.  ELAN from a rewriting logic point of view , 2002, Theor. Comput. Sci..

[12]  Matthew Hennessy.  A distributed Pi-calculus , 2007 .

[13]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[14]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[15]  Christian Johansen,et al.  Timers for Distributed Systems , 2006, Electron. Notes Theor. Comput. Sci..

[16]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[17]  Gabriel Ciobanu,et al.  Modelling and Verification of Timed Interaction and Migration , 2008, FASE.

[18]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[19]  Eelco Visser,et al.  Stratego: A Language for Program Transformation Based on Rewriting Strategies , 2001, RTA.

[20]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[21]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[22]  Claude Kirchner,et al.  An overview of ELAN , 1998, WRLA.

[23]  Jim Woodcock,et al.  Theoretical Aspects of Computing - ICTAC 2007, 4th International Colloquium, Macau, China, September 26-28, 2007, Proceedings , 2007, ICTAC.

[24]  Claude Kirchner,et al.  Rewriting with Strategies in ELAN: A Functional Semantics , 2001, Int. J. Found. Comput. Sci..

[25]  Flavio Corradini,et al.  Absolute versus relative time in process algebras , 1999, EXPRESS.

[26]  Gabriel Ciobanu,et al.  Mobile Ambients with Timers and Types , 2007, ICTAC.

[27]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .