Communicating sequential processes
Communicating sequential processes
Bisimulation through probabilistic testing
Information and Computation
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
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Measure and probability for concurrency theorists
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Communication and Concurrency
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A theory of stochastic systems: part I: Stochastic automata
Information and Computation
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
Quantitative verification: models techniques and tools
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Quantitative verification: models, techniques and tools
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Demonic Approach to Information in Probabilistic Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A theory of stochastic systems part I: Stochastic automata
Information and Computation
Trace-based semantics for probabilistic timed I/O automata
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Continuous time and/or continuous distributions
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
A logical duality for underspecified probabilistic systems
Information and Computation
A characterization of meaningful schedulers for continuous-time markov decision processes
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Bisimulations for non-deterministic labelled markov processes
Mathematical Structures in Computer Science
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountable branching. Models of such systems have been proposed previously. Here, we introduce a model that extends probabilistic automata to the continuous setting. We identify the class of schedulers that ensures measurability properties on executions, and show that such measurability properties are preserved by parallel composition. Finally, we demonstrate how these results allow us to define an alternative notion of weak bisimulation in our model.