Bisimulation through probabilistic testing
Information and Computation
A calculus of mobile processes, I
Information and Computation
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Labelled Markov Processes: Stronger and Faster Approximations
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Labelled markov processes
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Stochastic transition systems for continuous state spaces and non-determinism
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A logical duality for underspecified probabilistic systems
Information and Computation
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
This paper establishes a Stone-type duality between specifications and infLMPs. An infLMP is a probabilistic process whose transitions satisfy super-additivity instead of additivity. Interestingly, its simple structure can encode a mix of probabilistic and non-deterministic behaviors. Our duality shows that an infLMP can be considered as a demonic representative of a system's information. Moreover, it carries forward a view where states are less important, and events, or properties, become the main characters, as it should be in probability theory. Along the way, we show that bisimulation and simulation are naturally interpreted in this setting, and we exhibit the interesting relationship between infLMPs and the usual probabilistic modal logics.