Add to ORKGAbstract. This paper presents the design of a novel distributed algo-rithm d-IRA for the reachability analysis of linear hybrid automata. Re-cent work on iterative relaxation abstraction (IRA) is leveraged to dis-tribute the reachability problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamples. The d-IRA algorithm is resistant to failure of multiple computational nodes. The ex-perimental results provide promising evidence for the possible successful application of this technique.
A new approach is presented for computing approximations of the reached sets of linear hybrid automa...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...
AbstractThe existing techniques for reachability analysis of linear hybrid automata do not scale wel...
Abstract. Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems con...
The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This n...
International audienceWe address the problem of reachability in distributed systems, modelled as net...
Abstract: Ariadne is an in-progress open environment to design algorithms for computing with hybrid ...
Abstract: Ariadne is an in-progress open environment to design algorithms for computing with hybrid ...
This thesis addresses the problem of reachability analysis with the focus on linear hybrid systems. ...
金沢大学理工研究域電子情報学系We can model embedded systems as hybrid systems. Moreover, they are distributed and r...
Hybrid automata are a powerful formalism for the representation of systems evolving according to bot...
When designing embedded systems, often the need arises to model systems having a mixed discrete and ...
AbstractHybrid automata are a powerful formalism for the representation of systems evolving accordin...
When designing embedded systems, often the need arises to model systems having a mixed discrete and ...
A new approach is presented for computing approximations of the reached sets of linear hybrid automa...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...
AbstractThe existing techniques for reachability analysis of linear hybrid automata do not scale wel...
Abstract. Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems con...
The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This n...
International audienceWe address the problem of reachability in distributed systems, modelled as net...
Abstract: Ariadne is an in-progress open environment to design algorithms for computing with hybrid ...
Abstract: Ariadne is an in-progress open environment to design algorithms for computing with hybrid ...
This thesis addresses the problem of reachability analysis with the focus on linear hybrid systems. ...
金沢大学理工研究域電子情報学系We can model embedded systems as hybrid systems. Moreover, they are distributed and r...
Hybrid automata are a powerful formalism for the representation of systems evolving according to bot...
When designing embedded systems, often the need arises to model systems having a mixed discrete and ...
AbstractHybrid automata are a powerful formalism for the representation of systems evolving accordin...
When designing embedded systems, often the need arises to model systems having a mixed discrete and ...
A new approach is presented for computing approximations of the reached sets of linear hybrid automa...
We present a general framework for the formal specification and algorithmic analysis of hybrid syste...
AbstractWe present a general framework for the formal specification and algorithmic analysis of hybr...