Termination of Probabilistic Concurrent Program
From MaRDI portal
Publication:4749184
DOI10.1145/2166.357214zbMath0511.68009OpenAlexW2091188761MaRDI QIDQ4749184
Sergiu Hart, Amir Pnueli, Micha Sharir
Publication date: 1983
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2166.357214
verificationalgorithmsMarkov chainsprogram analysisconcurrent processessynchronization protocolslockoutergodic setsasynchronous execution behaviordeterministic protocols
Related Items
Verification of multiprocess probabilistic protocols, Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints, Not all bugs are created equal, but robust reachability can tell the difference, Symbolic model checking for probabilistic timed automata, A logic for reasoning about time and reliability, Probabilistic Ianov's schemes, Symmetric and economical solutions to the mutual exclusion problem in a distributed system, State explosion in almost-sure probabilistic reachability, On the complexity of deciding fair termination of probabilistic concurrent finite-state programs, Symbolic model checking for probabilistic processes, Problems concerning fairness and temporal logic for conflict-free Petri nets, Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL, On the use of MTBDDs for performability analysis and verification of stochastic systems., Symbolic control for stochastic systems via finite parity games, Operational causality -- necessarily sufficient and sufficiently necessary, Unnamed Item, Minimization of probabilistic models of programs, Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study, Confluence and convergence modulo equivalence in probabilistically terminating reduction systems, Termination of nondeterministic quantum programs, On the hardness of analyzing probabilistic programs, Deciding bisimilarity and similarity for probabilistic processes., Fair Termination for Parameterized Probabilistic Concurrent Systems, Concurrent reachability games, Probabilistic Model Checking of the PDGF Signaling Pathway, Preface to the special issue on probabilistic model checking, Hidden-Markov program algebra with iteration, Communicating processes, scheduling, and the complexity of nontermination, Recursive Markov Decision Processes and Recursive Stochastic Games, Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness, On Decision Problems for Probabilistic Büchi Automata, Probabilistic termination versus fair termination, Quantitative Analysis under Fairness Constraints, A faithful embedding of parallel computations in star-finite models, An elementary proof that Herman's ring is \(\Theta (N^{2})\), A probabilistic dynamic logic, On the verification of qualitative properties of probabilistic processes under fairness constraints., Global and local views of state fairness
