Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process algebra
Bisimulation through probabilistic testing
Information and Computation
Probabilistic and prioritized models of timed CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Theoretical Computer Science
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Finite-Control Mobile Ambients
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
On Reduction Semantics for the Push and Pull Ambitent Calculus
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Noninterference through flow analysis
Journal of Functional Programming
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
Continuous-Time Probabilistic KLAIM
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Logic for Performance and Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Semantic analysis of gossip protocols for wireless sensor networks
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
| Hi-index | 5.23 |
The calculus of Mobile Ambients has been introduced for expressing mobility and mobile computation. In this paper we present a probabilistic version of Mobile Ambients by augmenting the syntax of the original Ambient Calculus with a (guarded) probabilistic choice operator. To allow for the representation of both the probabilistic behaviour introduced through the new probabilistic choice operator and the nondeterminism present in the original Ambient Calculus we use probabilistic automata as the underpinning semantic model. The Ambient logic is a logic for Mobile Ambients that contains a novel treatment of both locations and hidden names. For specifying properties of Probabilistic Mobile Ambients, we extend this logic to specify probabilistic behaviour. In addition, to show the utility of our approach we present an example of a virus infecting a network.