A language-theoretic view of verification

DOI10.1142/9789814271059_0005MaRDI QIDQ4907857zbMATH OpenOpenAlexFDO

Authors Kamal Lodaya

Publication date 26 February 2013

Published in Modern Applications of Automata Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814271059_0005

zbMATH Keywords

computation tree logicinclusion problemsinterval temporal logiclinear temporal logicmembershipnonemptinessregular languagesverification

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Specification and verification using temporal logics
• Temporal logic and state systems
• Temporal logic and fair discrete systems
• The automata-theoretic approach to verification of reactive systems
• scientific article; zbMATH DE number 3932379

Cited in

(2)

• Validity in intensional languages: A new approach
• From Löwenheim to PSL and SVA

This page was built for publication: A language-theoretic view of verification

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