Model checking linear properties of prefix-recognizable systems

DOI10.1007/3-540-45657-0_31MaRDI QIDQ4804910zbMATH OpenFDO

Authors Orna Kupferman, Nir Piterman, Moshe Y. Vardi

Publication date 1 May 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2404/24040371.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An automata-theoretic approach to infinite-state systems
• An automata-theoretic approach to reasoning about infinite-state systems
• Computer Aided Verification
• Algorithmic metatheorems for decidable LTL model checking over infinite systems
• Finite Automata and the Analysis of Infinite Transition Systems

Cited in

(8)

• Analyzing pushdown systems with stack manipulation
• Operator precedence temporal logic and model checking
• Automata theory and model checking
• Algorithmic metatheorems for decidable LTL model checking over infinite systems
• An automata-theoretic approach to infinite-state systems
• Computer Aided Verification
• SMT-based model checking of max-plus linear systems
• Model-checking structured context-free languages

Describes a project that uses

Uses Software

• CESAR

This page was built for publication: Model checking linear properties of prefix-recognizable systems

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