Parity Automata for Quantitative Linear Time Logics

DOI10.4230/LIPICS.CALCO.2017.7MaRDI QIDQ4580202zbMATHOpenAlexFDO

Authors Shunsuke Shimizu, Ichiro Hasuo, Corina Cîrstea

Publication date 13 August 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.CALCO.2017.7

zbMATH Keywords

coalgebraquantitative logiclinear time logicparity automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• A Paraconsistent Linear-time Temporal Logic
• Model Checking Quantitative Linear Time Logic
• Automata and temporal logic over arbitrary linear time
• A quantitative approach for linear temporal logic based on finite transition systems
• On relation between linear temporal logic and quantum finite automata
• scientific article; zbMATH DE number 2084388
• Linear Temporal Logic of Constraint Automata
• scientific article; zbMATH DE number 1701759
• Linear parametric model checking of timed automata

Cited in

(3)

• Resource-aware automata and games for optimal synthesis
• Linear-time logics -- a coalgebraic perspective
• Game-based local model checking for the coalgebraic \(\mu\)-calculus

This page was built for publication: Parity Automata for Quantitative Linear Time Logics

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