A probabilistic higher-order fixpoint logic

DOI10.4230/LIPICS.FSCD.2020.19MaRDI QIDQ6854416zbMATH OpenFDO

Authors Yo Mitani, Naoki Kobayashi, Takeshi Tsukada

Publication date 24 February 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2020.19

zbMATH Keywords

higher-order fixpoint logicmodel checkingprobabilistic logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX) Theory of computing (68Qxx)

Cites work

• A logic for reasoning about time and reliability
• A probabilistic higher-order fixpoint logic
• A type-directed negation elimination
• CONCUR 2004 - Concurrency Theory
• Deciding the value 1 problem for probabilistic leaktight automata
• Higher-order program verification via HFL model checking
• scientific article; zbMATH DE number 1104375 (Why is no real title available?)
• scientific article; zbMATH DE number 7357543 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• scientific article; zbMATH DE number 4187792 (Why is no real title available?)
• On the relationship between higher-order recursion schemes and higher-order fixpoint logic
• On the termination problem for probabilistic higher-order recursive programs
• Probabilistic automata
• Probabilistic automata on finite words: decidable and undecidable problems
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Results on the propositional \(\mu\)-calculus
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• Tractable probabilistic -calculus that expresses probabilistic temporal logics

Cited in

(1)

• A probabilistic higher-order fixpoint logic

This page was built for publication: A probabilistic higher-order fixpoint logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854416)