This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
In this paper, a model is proposed for multi-agent probabilistic reasoning in a distributed environment. Unlike other methods, this model is capable of processing input in a truly...
In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow...
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...