Safety verification of non-linear hybrid systems is quasi-semidecidable

DOI10.1007/978-3-642-13562-0_36zbMATH Open1284.68415OpenAlexW2108345361MaRDI QIDQ3569093FDOQ3569093

Authors: Stefan Ratschan 

Publication date: 17 June 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_36

Recommendations

• Safety verification of non-linear hybrid systems is quasi-decidable
• GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
• Automated Technology for Verification and Analysis
• Publication:4945221
• Hybrid Systems: Computation and Control

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (10)

• Safety verification of non-linear hybrid systems is quasi-decidable
• \(\epsilon\)-semantics computations on biological systems
• Incremental computation of succinct abstractions for hybrid systems
• Verification of Hybrid Systems
• Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
• Title not available (Why is that?)
• Quasi-decidability of a fragment of the first-order theory of real numbers
• Automated Technology for Verification and Analysis
• GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
• Safety verification for probabilistic hybrid systems

This page was built for publication: Safety verification of non-linear hybrid systems is quasi-semidecidable

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