Parametric probabilistic transition systems for system design and analysis

DOI10.1007/S00165-006-0015-2zbMATH Open1111.68084OpenAlexW2000865099MaRDI QIDQ877158FDOQ877158

Authors: Ruggero Lanotte, Angelo Troina, Andrea Maggiolo-Schettini 

Publication date: 19 April 2007

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-006-0015-2

Recommendations

• Tweaking the odds in probabilistic timed automata
• Model checking for probabilistic timed automata
• Theoretical Aspects of Computing - ICTAC 2004
• Multi-objective parameter synthesis in probabilistic hybrid systems
• Probabilistic extensions of process algebras.

zbMATH Keywords

ParametersReachabilityDiscrete-time Markov chainsProbabilistic non-repudiation protocol

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• HyTech: A model checker for hybrid systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of timed automata
• Probability with Martingales
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating labelled Markov processes
• Theoretical Aspects of Computing - ICTAC 2004
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Model checking of probabilistic and nondeterministic systems
• Metrics for labelled Markov processes
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Title not available (Why is that?)
• Parametric real-time reasoning
• 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
• Title not available (Why is that?)
• Composition and behaviors of probabilistic I/O automata
• Weak bisimulation for probabilistic timed automata
• A decomposition theorem for probabilistic transition systems
• Automatic analysis of a non-repudiation protocol
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
• Formal abstraction and synthesis of parametric stochastic processes
• Parameter synthesis for Markov models: covering the parameter space
• The complexity of reachability in parametric Markov decision processes
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Finding provably optimal Markov chains
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• Model repair for probabilistic systems
• An extension of the inverse method to probabilistic timed automata
• Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems
• Fine-tuning the odds in Bayesian networks
• Parameter Synthesis Algorithms for Parametric Interval Markov Chains
• Gradient-descent for randomized controllers under partial observability
• Automatically finding the right probabilities in Bayesian networks
• System design of stochastic models using robustness of temporal properties
• Interval Markov Decision Processes with Continuous Action-Spaces
• Title not available (Why is that?)
• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
• Parameter-Independent Strategies for pMDPs via POMDPs
• Title not available (Why is that?)
• Efficient sensitivity analysis for parametric robust Markov chains
• A probabilistic protocol for the assessment of transition and control
• Compositional weak metrics for group key update
• POMDP controllers with optimal budget

Uses Software

• HyTech
• Uppaal

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)