Sciweavers

143 search results - page 3 / 29
» Bisimulation for Labelled Markov Processes
Sort
View
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 4 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
HYBRID
2005
Springer
13 years 12 months ago
Bisimulation for Communicating Piecewise Deterministic Markov Processes (CPDPs)
Abstract. CPDPs (Communicating Piecewise Deterministic Markov Processes) can be used for compositional specification of systems from the class of stochastic hybrid processes forme...
Stefan Strubbe, A. J. van der Schaft
ICALP
1998
Springer
13 years 10 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier
ENTCS
2006
140views more  ENTCS 2006»
13 years 6 months ago
Stochastic Ambient Calculus
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We pres...
Maria Grazia Vigliotti, Peter G. Harrison