scientific article; zbMATH DE number 7471675

MaRDI QIDQ5028436

Naoki Kobayashi, Yo Mitani, Takeshi Tsukada

Publication date: 9 February 2022

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

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

zbMATH Keywords

model checkingprobabilistic logicshigher-order fixpoint logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Unnamed Item

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Real quantifier elimination is doubly exponential
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• A logic for reasoning about time and reliability
• Analyzing probabilistic pushdown automata
• Higher-order program verification via HFL model checking
• Deciding the value 1 problem for probabilistic leaktight automata
• Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• On the relationship between higher-order recursion schemes and higher-order fixpoint logic
• Probabilistic automata

This page was built for publication: