Compositional methods for probabilistic systems
From MaRDI portal
Recommendations
- Composition and behaviors of probabilistic I/O automata
- Compositional abstraction for stochastic systems
- Assume-guarantee verification for probabilistic systems
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- Processes, Terms and Cycles: Steps on the Road to Infinity
Cited in
(34)- Compositional strategy synthesis for stochastic games with multiple objectives
- Reconciling real and stochastic time: the need for probabilistic refinement
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Syntactic partial order compression for probabilistic reachability
- Stepwise refinement of sequence diagrams with soft real-time constraints
- A perspective on service orchestration
- Probabilistic contracts for component-based design
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Probabilistic event structures and domains
- Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
- An exercise on transition systems
- Synthesis from probabilistic components
- Brief Introduction to Probabilistic Compositional Models
- Model checking probabilistic systems
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
- The Complexity of Synthesis from Probabilistic Components
- Compositional abstraction for stochastic systems
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Compositional probabilistic verification through multi-objective model checking
- Synthesizing Probabilistic Invariants via Doob’s Decomposition
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Information hiding in probabilistic concurrent systems
- Constraint Markov chains
- Communicating Sequential Processes. The First 25 Years
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- On the expressive power of schedulers in distributed probabilistic systems
- Finding equilibria: simpler for pessimists, simplest for optimists
- Compositional reasoning for parametric probabilistic automata
- -stationary Nash equilibria in multi-player stochastic graph games
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Switched PIOA: parallel composition via distributed scheduling
- Implementing biological hybrid systems: allowing composition and avoiding stiffness
- Understanding deadlock and livelock behaviors in hybrid control systems
- Making random choices invisible to the scheduler
This page was built for publication: Compositional methods for probabilistic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791844)
