Verifying complex continuous real-time systems with coinductive CLP(R)

DOI10.1007/978-3-642-13089-2_45zbMATH Open1284.68365OpenAlexW1799344754MaRDI QIDQ3564892FDOQ3564892

Authors: Neda Saeedloei, Gopal Gupta 

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_45

Recommendations

• scientific article; zbMATH DE number 1696823
• Symbolic model checking for real-time systems
• A theory of timed automata
• Deductive verification of real-time systems using STeP
• Timed modal logics for real-time systems. Specification, verification and control

Mathematics Subject Classification ID

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

Cited In (5)

• Semantics of temporal constrained objects
• Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
• Time-Bounded Verification of CTMCs against Real-Time Specifications
• Verification of opacity and diagnosability for pushdown systems
• Idealized coinductive type systems for imperative object-oriented programs

Uses Software

• Uppaal

This page was built for publication: Verifying complex continuous real-time systems with coinductive CLP(R)

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