Logics and automata for verification: Expressiveness and decidability issues

MaRDI QIDQ2763541zbMATH OpenFDO

Authors Jesper Gulmann Henriksen

Publication date 16 January 2002

zbMATH Keywords

noninterleaving asynchronous computations

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Recommendations

• Verification of logic programs
• scientific article; zbMATH DE number 5245252
• Technical systems in logic: questions of formalization and automatic verification
• Automata-theoretic techniques for modal logics of programs
• scientific article; zbMATH DE number 1973214
• Introduction to the special issue on computational logic for verification
• Publication:4503922
• scientific article; zbMATH DE number 1617312
• Verification from Declarative Specifications Using Logic Programming
• scientific article; zbMATH DE number 4195154

Cited in

(4)

• Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
• scientific article; zbMATH DE number 139804 (Why is no real title available?)
• Local temporal logic is expressively complete for cograph dependence alphabets
• scientific article; zbMATH DE number 5245252 (Why is no real title available?)

Describes a project that uses

Uses Software

• MONA

This page was built for publication: Logics and automata for verification: Expressiveness and decidability issues

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