Timed mobility in process algebra and Petri nets

DOI10.1016/j.jlap.2011.05.002zbMath1230.68154OpenAlexW2036541902WikidataQ57936767 ScholiaQ57936767MaRDI QIDQ638567

Maciej Koutny, Gabriel Ciobanu

Publication date: 12 September 2011

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2011.05.002

zbMATH Keywords

operational semanticsprocess algebramigrationlocationhigh-level timed Petri netslocal clocks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

A UTP approach for rTiMo ⋮ Strategy based semantics for mobility with time and access permissions ⋮ UTP Semantics for rTiMo ⋮ Employing Costs in Multiagent Systems with Timed Migration and Timed Communication ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ Dynamics of reputation in mobile agents systems and weighted timed automata

Uses Software

• M-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A compositional Petri net translation of general \(\pi\)-calculus terms
• M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages
• Petri net algebra
• Mobile ambients
• Absolute versus relative time in process algebras.
• Timing and causality in process algebra
• A Distributed Pi-Calculus
• Mobile Ambients with Timers and Types
• CONCUR 2004 - Concurrency Theory
• Theoretical Aspects of Computing - ICTAC 2004

This page was built for publication: Timed mobility in process algebra and Petri nets