Timed mobility in process algebra and Petri nets
From MaRDI portal
(Redirected from Publication:638567)
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 50851 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 2064221 (Why is no real title available?)
- scientific article; zbMATH DE number 4119652 (Why is no real title available?)
- A Distributed Pi-Calculus
- A Petri net semantics of a simple process algebra for mobility
- A compositional Petri net translation of general -calculus terms
- Absolute versus relative time in process algebras.
- CONCUR 2004 - Concurrency Theory
- M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages
- Mobile Ambients with Timers and Types
- Mobile ambients
- Petri net algebra
- Theoretical Aspects of Computing - ICTAC 2004
- Timing and causality in process algebra
Cited in
(12)- Interaction in time and space
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- A Petri net semantics of a simple process algebra for mobility
- A UTP approach for rTiMo
- UTP semantics for rTiMo
- A Timed Mobility Semantics Based on Rewriting Strategies
- A probabilistic logic for pTiMo
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Strategy based semantics for mobility with time and access permissions
- Extending timed mobility with probabilities and real-time
- Dynamics of reputation in mobile agents systems and weighted timed automata
- Employing costs in multiagent systems with timed migration and timed communication
This page was built for publication: Timed mobility in process algebra and Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638567)