Model checking linear coalgebraic temporal logics: an automata-theoretic approach

DOI10.1007/978-3-642-22944-2_10MaRDI QIDQ3090866zbMATH OpenOpenAlexFDO

Authors Corina Cîrstea

Publication date 2 September 2011

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/272356/1/CALCO.pdf

zbMATH Keywords

automatacoalgebramodel checkingtemporal logictrace

Mathematics Subject Classification ID

Temporal logic (03B44) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Maximal traces and path-based coalgebraic temporal logics
• A coalgebraic approach to linear-time logics
• Generic infinite traces and path-based coalgebraic temporal logics
• Canonical coalgebraic linear time logics
• scientific article; zbMATH DE number 6851946

Cited in

(8)

• An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
• Generic infinite traces and path-based coalgebraic temporal logics
• Linear temporal logic symbolic model checking
• The Linear Temporal Logic of Rewriting Maude Model Checker
• scientific article; zbMATH DE number 6454071 (Why is no real title available?)
• On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Maximal traces and path-based coalgebraic temporal logics

This page was built for publication: Model checking linear coalgebraic temporal logics: an automata-theoretic approach

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