An automata-theoretic approach for model-checking systems with unspecified components

DOI10.1007/978-3-540-31848-4_11MaRDI QIDQ5710640zbMATH OpenOpenAlexFDO

Authors Gaoyan Xie, Zhe Dang

Publication date 2 December 2005

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

Full work available at URL https://doi.org/10.1007/b106767

Mathematics Subject Classification ID

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

Recommendations

• Automata-Theoretic Model Checking Revisited
• An automata-theoretic approach to model-checking systems and specifications over infinite data domains
• Dealing with incompleteness in automata-based model checking
• A partial approach to model checking
• An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
• Model-checking systems with unbounded variables without abstraction
• Model checking using automata theory
• Modeling, specification, and verification of automaton programs
• An automata-theoretic approach to reasoning about parameterized systems and specifications

Cited in

(6)

• An automata-based view on configurability and uncertainty
• Verification of asynchronous systems with an unspecified component
• Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
• scientific article; zbMATH DE number 1564050 (Why is no real title available?)
• scientific article; zbMATH DE number 2201909 (Why is no real title available?)
• Automated Technology for Verification and Analysis

Describes a project that uses

Uses Software

• MOCHA

This page was built for publication: An automata-theoretic approach for model-checking systems with unspecified components

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