Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2008.12.030 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: O-minimal hybrid systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736610 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2008.12.030 / rank
 
Normal rank

Latest revision as of 15:30, 30 December 2024

scientific article; zbMATH DE number 6418594
Language Label Description Also known as
English
Approximated Reachability on Hybrid Automata: Falsification meets Certification
scientific article; zbMATH DE number 6418594

    Statements

    Approximated Reachability on Hybrid Automata: Falsification meets Certification (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2015
    0 references
    hybrid automata
    0 references
    reachability analysis
    0 references
    abstraction-refinement
    0 references
    0 references
    0 references

    Identifiers