Strategy based semantics for mobility with time and access permissions

DOI10.1007/s00165-014-0324-9zbMath1343.68163OpenAlexW1986561091WikidataQ57936471 ScholiaQ57936471MaRDI QIDQ890480

Gabriel Ciobanu, Maciej Koutny, Jason Steggles

Publication date: 10 November 2015

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=208761/4FAF484A-BFA0-4579-89C2-CDFB098B990D.pdf&pub_id=208761

zbMATH Keywords

process algebramobilitytimestrategiesrewriting logicaccess permissions

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 (2)

A UTP approach for rTiMo ⋮ UTP Semantics for rTiMo

Uses Software

• ELAN
• Maude
• Tom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Timed mobility in process algebra and Petri nets
• Two case studies of semantics execution in Maude: CCS and LOTOS
• Conditional rewriting logic as a unified model of concurrency
• Mobile ambients
• ELAN from a rewriting logic point of view
• Maude: specification and programming in rewriting logic
• Absolute versus relative time in process algebras.
• Secure implementations of typed channel abstractions
• A Distributed Pi-Calculus
• Mobile Ambients with Timers and Types
• Complete Sets of Reductions for Some Equational Theories
• A Timed Mobility Semantics Based on Rewriting Strategies
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• CONCUR 2004 - Concurrency Theory
• Global Computing. Programming Environments, Languages, Security, and Analysis of Systems

This page was built for publication: Strategy based semantics for mobility with time and access permissions