Efficient verification of timed automata with BDD-like data-structures

DOI10.1007/3-540-36384-X_17MaRDI QIDQ4414389zbMATH OpenFDO

Authors Farn Wang

Publication date 25 July 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/2575/25750189.htm

zbMATH Keywords

BDDdata-structuresmodel-checkingtimed automataverification

Mathematics Subject Classification ID

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

Recommendations

• Efficient reachability analysis and refinement checking of timed automata using BDDs
• Improvements in BDD-based reachability analysis of timed automata
• scientific article; zbMATH DE number 2102717
• scientific article; zbMATH DE number 1400094
• Can decision diagrams overcome state space explosion in real-time verification?

Cited in

(10)

• Bounded determinization of timed automata with silent transitions
• Efficient data structure for fully symbolic verification of real-time software systems
• Improvements in BDD-based reachability analysis of timed automata
• Verification for Timed Automata extended with Unbounded Discrete Data Structures
• Improvements for the Symbolic Verification of Timed Automata
• Efficient reachability analysis and refinement checking of timed automata using BDDs
• scientific article; zbMATH DE number 1400094 (Why is no real title available?)
• A menagerie of timed automata
• Can decision diagrams overcome state space explosion in real-time verification?
• First-Order Timed Runtime Verification Using BDDs

Describes a project that uses

Uses Software

• Kronos
• Uppaal
• Uppaal2k

This page was built for publication: Efficient verification of timed automata with BDD-like data-structures

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