Parametric probabilistic transition systems for system design and analysis
From MaRDI portal
Publication:877158
Recommendations
Cites work
- scientific article; zbMATH DE number 1701759 (Why is no real title available?)
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 46616 (Why is no real title available?)
- scientific article; zbMATH DE number 1361118 (Why is no real title available?)
- scientific article; zbMATH DE number 1927573 (Why is no real title available?)
- scientific article; zbMATH DE number 1786649 (Why is no real title available?)
- scientific article; zbMATH DE number 2090701 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A decomposition theorem for probabilistic transition systems
- A logic for reasoning about time and reliability
- A theory of timed automata
- Approximating labelled Markov processes
- Automatic analysis of a non-repudiation protocol
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Bisimulation through probabilistic testing
- Composition and behaviors of probabilistic I/O automata
- HyTech: A model checker for hybrid systems
- Metrics for labelled Markov processes
- Model checking of probabilistic and nondeterministic systems
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Parametric real-time reasoning
- Probability with Martingales
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Theoretical Aspects of Computing - ICTAC 2004
- Weak bisimulation for probabilistic timed automata
Cited in
(24)- An extension of the inverse method to probabilistic timed automata
- On the Complexity of Reachability in Parametric Markov Decision Processes
- A probabilistic protocol for the assessment of transition and control
- Multi-objective parameter synthesis in probabilistic hybrid systems
- Formal abstraction and synthesis of parametric stochastic processes
- Automatically finding the right probabilities in Bayesian networks
- Parameter-Independent Strategies for pMDPs via POMDPs
- Finding provably optimal Markov chains
- Interval Markov Decision Processes with Continuous Action-Spaces
- The complexity of reachability in parametric Markov decision processes
- Compositional weak metrics for group key update
- Gradient-descent for randomized controllers under partial observability
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- System design of stochastic models using robustness of temporal properties
- Efficient sensitivity analysis for parametric robust Markov chains
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- POMDP controllers with optimal budget
- Parameter synthesis for Markov models: covering the parameter space
- Fine-tuning the odds in Bayesian networks
- Consistency for parametric interval Markov chains
- Model repair for probabilistic systems
- Parameter Synthesis Algorithms for Parametric Interval Markov Chains
This page was built for publication: Parametric probabilistic transition systems for system design and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877158)
