scientific article; zbMATH DE number 7378557

DOI10.4230/LIPIcs.CONCUR.2018.13MaRDI QIDQ5009427

Hugo Gimbert, Paulin Fournier

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1802.04067

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

zbMATH Keywords

probabilitiestemporal logicszero-automata

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating automata on infinite trees
• A logic for reasoning about time and reliability
• Randomization in Automata on Infinite Trees
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Reasoning with time and chance
• “Sometimes” and “not never” revisited
• Alternation
• Thin MSO with a Probabilistic Path Quantifier.
• Measure Quantifier in Monadic Second Order Logic
• An automata-theoretic approach to branching-time model checking
• Probabilistic ω-automata
• Probabilistic automata

This page was built for publication: