Strategy based semantics for mobility with time and access permissions

DOI10.1007/S00165-014-0324-9MaRDI QIDQ890480zbMATH OpenOpenAlexWikidataFDO

Authors 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

mobilitytimeprocess algebrastrategiesrewriting logicaccess permissions

Mathematics Subject Classification ID

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

Recommendations

• A Timed Mobility Semantics Based on Rewriting Strategies
• A Temporal Semantic-Based Access Control Model
• Expressing and verifying temporal and structural properties of mobile agents
• Extending timed mobility with probabilities and real-time
• scientific article; zbMATH DE number 1231689
• Resource access control in systems of mobile agents
• scientific article; zbMATH DE number 1956519

Cites work

• scientific article; zbMATH DE number 1722718 (Why is no real title available?)
• scientific article; zbMATH DE number 3888893 (Why is no real title available?)
• scientific article; zbMATH DE number 108365 (Why is no real title available?)
• scientific article; zbMATH DE number 1231543 (Why is no real title available?)
• scientific article; zbMATH DE number 1231673 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• A Distributed Pi-Calculus
• A Timed Mobility Semantics Based on Rewriting Strategies
• Absolute versus relative time in process algebras.
• CONCUR 2004 - Concurrency Theory
• Complete Sets of Reductions for Some Equational Theories
• Conditional rewriting logic as a unified model of concurrency
• ELAN from a rewriting logic point of view
• Maude: specification and programming in rewriting logic
• Mobile Ambients with Timers and Types
• Mobile ambients
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Secure implementations of typed channel abstractions
• The Klaim project: Theory and practice
• Timed mobility in process algebra and Petri nets
• Two case studies of semantics execution in Maude: CCS and LOTOS

Cited in

(6)

• A process calculus BigrTiMo of mobile systems and its formal semantics
• Extending timed mobility with probabilities and real-time
• UTP semantics for rTiMo
• A UTP approach for rTiMo
• A Timed Mobility Semantics Based on Rewriting Strategies
• Timed mobility in process algebra and Petri nets

Describes a project that uses

Uses Software

• ELAN
• Maude
• Tom

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890480)