scientific article; zbMATH DE number 7378580

DOI10.4230/LIPIcs.CONCUR.2018.36MaRDI QIDQ5009454

C. R. Ramakrishnan, Andrey Gorlin

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

model checkingprobabilistic systemsbranching systemsmodal mu-calculusprobabilistic logics

Mathematics Subject Classification ID

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

Uses Software

• Oz

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
• Model checking games for the quantitative \(\mu \)-calculus
• Measure properties of regular sets of trees
• Probabilistic temporal logics via the modal mu-calculus
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Recursive Markov Decision Processes and Recursive Stochastic Games
• Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
• On the equivalence of game and denotational semantics for the probabilistic mu-calculus
• Model Checking Stochastic Branching Processes
• Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Łukasiewicz μ-calculus
• Probabilistic modal {\mu}-calculus with independent product
• Model checking with probabilistic tabled logic programming
• Results on the quantitative μ-calculus qM μ
• Model Checking Probabilistic Pushdown Automata
• Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars

This page was built for publication: