d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

DOI10.1007/978-3-540-78929-1_48MaRDI QIDQ3523144zbMATH OpenOpenAlexFDO

Authors Sumit Kumar Jha

Publication date 2 September 2008

Published in Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78929-1_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Recommendations

• Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
• A work-efficient distributed algorithm for reachability analysis.
• A work-efficient distributed algorithm for reachability analysis
• Lazy reachability analysis in distributed systems
• Distributed algorithms for time optimal reachability analysis

Cited in

(4)

• Lazy reachability analysis in distributed systems
• Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
• Distributed and predictable software model checking
• Distributed algorithms for time optimal reachability analysis

Describes a project that uses

Uses Software

• PHAVer

This page was built for publication: d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

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