Bounded model checking for region automata

DOI10.1007/B100824MaRDI QIDQ5464751zbMATH OpenOpenAlexFDO

Authors Fang Yu, Bow-Yaw Wang, Yao-Wen Huang

Publication date 19 August 2005

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

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

Mathematics Subject Classification ID

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

Recommendations

• Automated Technology for Verification and Analysis
• SAT-BASED MODEL CHECKING FOR REGION AUTOMATA
• Bounded model checking for timed automata
• Bounded model checking with SNF, alternating automata, and Büchi automata
• Bounded Model Checking for Weak Alternating Büchi Automata
• Bounded Model Checking for Parametric Timed Automata
• Semi-formal bounded model checking
• Bounded model checking for all regular properties
• Bounded model checking using satisfiability solving
• An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking

Cited in

(4)

• Bounded model checking with SNF, alternating automata, and Büchi automata
• On regions and zones for event-clock automata
• Automated Technology for Verification and Analysis
• SAT-BASED MODEL CHECKING FOR REGION AUTOMATA

Describes a project that uses

Uses Software

• Kronos
• Uppaal

This page was built for publication: Bounded model checking for region automata

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