CCS + time = an interleaving model for real time systems
Proceedings of the 18th international colloquium on Automata, languages and programming
A compositional approach to performance modelling
A compositional approach to performance modelling
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Restricted Broadcast Process Theory
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Stochastic restricted broadcast process theory
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
| Hi-index | 0.00 |
We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network is modeled by a stochastic mobility function which allows to change part of a network topology depending on an exponentially distributed delay and a network topology constraint. We allow continuous time stochastic behavior of processes running at network nodes, e.g. in order to be able to model randomized protocols. The introduction of group broadcast and an operator to help avoid flooding allows us to define a novel notion of broadcast abstraction. Finally, we define a weak bisimulation congruence and apply our theory on a leader election protocol.