scientific article; zbMATH DE number 1693437

MaRDI QIDQ2763979zbMATH OpenFDO

Authors D. Beyer

Publication date 22 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2021/20210318

zbMATH Keywords

BDDsdiscretizationformal verificationreal-time systemsTimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1852149
• Improved BDD-based discrete analysis of timed systems
• scientific article; zbMATH DE number 2104641
• scientific article; zbMATH DE number 7297846
• scientific article; zbMATH DE number 1953031
• Improvements for the Symbolic Verification of Timed Automata
• scientific article; zbMATH DE number 1670769
• The power of reachability testing for timed automata
• Bounded model checking for timed automata

Cited in

(9)

• Model checking for probabilistic timed automata
• Improving search order for reachability testing in timed automata
• Improvement of a reachability analysis algorithm for real-time systems
• Improvements for the Symbolic Verification of Timed Automata
• scientific article; zbMATH DE number 1953031 (Why is no real title available?)
• scientific article; zbMATH DE number 1852149 (Why is no real title available?)
• Can decision diagrams overcome state space explosion in real-time verification?
• Performance analysis of probabilistic timed automata using digital clocks
• A process algebraic framework for specification and validation of real-time systems

Describes a project that uses

Uses Software

• Rabbit
• Uppaal

This page was built for publication:

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