Automatic abstraction algorithm for timed automata

MaRDI QIDQ3371683zbMATH OpenFDO

Authors Xiao-Li Zhi, Wei-Qin Tong, Lu Rong

Publication date 21 February 2006

zbMATH Keywords

specification analysisstate-explosion problem

Mathematics Subject Classification ID

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

Recommendations

• Automatic Abstraction Refinement for Timed Automata
• Analysis of timed systems using time-abstracting bisimulations
• scientific article; zbMATH DE number 5201490
• scientific article; zbMATH DE number 1507209
• scientific article; zbMATH DE number 2102690

Cited in

(6)

• Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
• Abstraction refinement algorithms for timed automata
• Automatic Abstraction Refinement for Timed Automata
• scientific article; zbMATH DE number 1796133 (Why is no real title available?)
• Better abstractions for timed automata
• An efficient state space construction for a class of timed automata

This page was built for publication: Automatic abstraction algorithm for timed automata

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