Pages that link to "Item:Q4749184"
From MaRDI portal
The following pages link to Termination of Probabilistic Concurrent Program (Q4749184):
Displaying 38 items.
- A probabilistic dynamic logic (Q792757) (← links)
- Global and local views of state fairness (Q804304) (← links)
- Not all bugs are created equal, but robust reachability can tell the difference (Q832220) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← links)
- Minimization of probabilistic models of programs (Q906254) (← links)
- An elementary proof that Herman's ring is \(\Theta (N^{2})\) (Q1041727) (← links)
- Verification of multiprocess probabilistic protocols (Q1079944) (← links)
- Probabilistic Ianov's schemes (Q1093361) (← links)
- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs (Q1111384) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- A logic for reasoning about time and reliability (Q1343864) (← links)
- Symmetric and economical solutions to the mutual exclusion problem in a distributed system (Q1348531) (← links)
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems (Q1726351) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Probabilistic termination versus fair termination (Q1822937) (← links)
- A faithful embedding of parallel computations in star-finite models (Q1825641) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Preface to the special issue on probabilistic model checking (Q2248070) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Termination of nondeterministic quantum programs (Q2453979) (← links)
- Concurrent reachability games (Q2465027) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness (Q3613069) (← links)
- Quantitative Analysis under Fairness Constraints (Q3648696) (← links)
- Symbolic model checking for probabilistic processes (Q4571974) (← links)
- Probabilistic Model Checking of the PDGF Signaling Pathway (Q4912384) (← links)
- (Q5002798) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
- On Decision Problems for Probabilistic Büchi Automata (Q5458366) (← links)
- Hidden-Markov program algebra with iteration (Q5740625) (← links)
- Symbolic control for stochastic systems via finite parity games (Q6122792) (← links)
- Introducing robust reachability (Q6632204) (← links)
