Termination of Probabilistic Concurrent Program
From MaRDI portal
Cited in
(40)- Fair termination for parameterized probabilistic concurrent systems
- Hidden-Markov program algebra with iteration
- Symmetric and economical solutions to the mutual exclusion problem in a distributed system
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
- Probabilistic termination versus fair termination
- Not all bugs are created equal, but robust reachability can tell the difference
- Probabilistic Ianov's schemes
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Symbolic model checking for probabilistic processes
- On Decision Problems for Probabilistic Büchi Automata
- Quantitative analysis under fairness constraints
- On the hardness of analyzing probabilistic programs
- A probabilistic dynamic logic
- State explosion in almost-sure probabilistic reachability
- Quantitative analysis with the probabilistic model checker PRISM
- Preface to the special issue on probabilistic model checking
- Termination of nondeterministic quantum programs
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- A logic for reasoning about time and reliability
- scientific article; zbMATH DE number 7376040 (Why is no real title available?)
- Recursive Markov decision processes and recursive stochastic games
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Deciding bisimilarity and similarity for probabilistic processes.
- Operational causality -- necessarily sufficient and sufficiently necessary
- Introducing robust reachability
- Minimization of probabilistic models of programs
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- Symbolic model checking for probabilistic timed automata
- Concurrent reachability games
- Probabilistic model checking of the PDGF signaling pathway
- Verification of multiprocess probabilistic protocols
- A faithful embedding of parallel computations in star-finite models
- Global and local views of state fairness
- Communicating processes, scheduling, and the complexity of nontermination
- Symbolic control for stochastic systems via finite parity games
This page was built for publication: Termination of Probabilistic Concurrent Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749184)
