A Timed Mobility Semantics Based on Rewriting Strategies

DOI10.1007/978-3-642-33826-7_10zbMath1315.68191OpenAlexW137260420WikidataQ57936624 ScholiaQ57936624MaRDI QIDQ4899686

Jason Steggles, Gabriel Ciobanu, Maciej Koutny

Publication date: 8 January 2013

Published in: Software Engineering and Formal Methods (Search for Journal in Brave)

Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=186735/BE6E278E-6C98-441F-B7A8-C077A193A176.pdf&pub_id=186735

zbMATH Keywords

process algebramobilitytimestrategiesrewriting logic

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Strategy based semantics for mobility with time and access permissions

This page was built for publication: A Timed Mobility Semantics Based on Rewriting Strategies