The Experts below are selected from a list of 2511 Experts worldwide ranked by ideXlab platform
Robert De Simone - One of the best experts on this subject based on the ideXlab platform.
-
syntax driven optimisations for Reachable State space construction of esterel programs
International Journal of Embedded Systems, 2006Co-Authors: Eric Vecchie, Robert De SimoneAbstract:We consider the issue of exploiting the structural form of ESTEREL programs (Berry and Gonthier, 1992) to partition the algorithmic Reachable State Space construction used in model-checking techniques (Clarke et al., 1999). The basic idea sounds utterly simple: in P; Q, first compute entirely the States reached in P and then carry on to Q, each time using only the relevant transition relation part. Difficulties appear in presence of parallelism: program blocks can be synchronised in various ways, which may lead to an excessive complexity in decomposition. We use the structural division as obtained from the programs syntax, some of the key 'cofactoring' features of the TiGeR BDD library (Coudert et al., 1993) and heuristic orderings between internal signals.
-
syntax driven Reachable State space construction of synchronous reactive programs
Computer Aided Verification, 2005Co-Authors: Eric Vecchie, Robert De SimoneAbstract:We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (Reachable State space) fix-point construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case of sequential composition: in P;Q, first compute entirely the States reached in P, and then only carry on to Q, each time using only the relevant local transition relation part. Here a brute-force symbolic breadth-first search would have mixed the exploration of P and Q instead. The introduction of parallel (State product) operators, as well as loop iterators and local synchronizing signals make the problem more difficult (and more interesting). We propose techniques to partition statically (”at compile time”) the program body, so as to obtain a good trade-off between locality and multiplicity of steps.
-
CAV - Syntax-driven Reachable State space construction of synchronous reactive programs
Computer Aided Verification, 2005Co-Authors: Eric Vecchie, Robert De SimoneAbstract:We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (Reachable State space) fix-point construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case of sequential composition: in P;Q, first compute entirely the States reached in P, and then only carry on to Q, each time using only the relevant local transition relation part. Here a brute-force symbolic breadth-first search would have mixed the exploration of P and Q instead. The introduction of parallel (State product) operators, as well as loop iterators and local synchronizing signals make the problem more difficult (and more interesting). We propose techniques to partition statically (”at compile time”) the program body, so as to obtain a good trade-off between locality and multiplicity of steps.
J.w. Burdick - One of the best experts on this subject based on the ideXlab platform.
-
ICRA - Trajectory planning using Reachable-State density functions
Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), 2002Co-Authors: R. Mason, J.w. BurdickAbstract:Presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic analysis, the algorithm efficiently constructs an approximation to the robot's Reachable-State density function. Based on a multiscale approach, the density function is then used to plan a path. One variation of the algorithm exhibits time complexity that is logarithmic in the number of steps. Simulations illustrate the method.
-
Trajectory planning using Reachable-State density functions
Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292), 2002Co-Authors: R. Mason, J.w. BurdickAbstract:Presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic analysis, the algorithm efficiently constructs an approximation to the robot's Reachable-State density function. Based on a multiscale approach, the density function is then used to plan a path. One variation of the algorithm exhibits time complexity that is logarithmic in the number of steps. Simulations illustrate the method.
Eric Vecchie - One of the best experts on this subject based on the ideXlab platform.
-
syntax driven optimisations for Reachable State space construction of esterel programs
International Journal of Embedded Systems, 2006Co-Authors: Eric Vecchie, Robert De SimoneAbstract:We consider the issue of exploiting the structural form of ESTEREL programs (Berry and Gonthier, 1992) to partition the algorithmic Reachable State Space construction used in model-checking techniques (Clarke et al., 1999). The basic idea sounds utterly simple: in P; Q, first compute entirely the States reached in P and then carry on to Q, each time using only the relevant transition relation part. Difficulties appear in presence of parallelism: program blocks can be synchronised in various ways, which may lead to an excessive complexity in decomposition. We use the structural division as obtained from the programs syntax, some of the key 'cofactoring' features of the TiGeR BDD library (Coudert et al., 1993) and heuristic orderings between internal signals.
-
syntax driven Reachable State space construction of synchronous reactive programs
Computer Aided Verification, 2005Co-Authors: Eric Vecchie, Robert De SimoneAbstract:We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (Reachable State space) fix-point construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case of sequential composition: in P;Q, first compute entirely the States reached in P, and then only carry on to Q, each time using only the relevant local transition relation part. Here a brute-force symbolic breadth-first search would have mixed the exploration of P and Q instead. The introduction of parallel (State product) operators, as well as loop iterators and local synchronizing signals make the problem more difficult (and more interesting). We propose techniques to partition statically (”at compile time”) the program body, so as to obtain a good trade-off between locality and multiplicity of steps.
-
CAV - Syntax-driven Reachable State space construction of synchronous reactive programs
Computer Aided Verification, 2005Co-Authors: Eric Vecchie, Robert De SimoneAbstract:We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (Reachable State space) fix-point construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case of sequential composition: in P;Q, first compute entirely the States reached in P, and then only carry on to Q, each time using only the relevant local transition relation part. Here a brute-force symbolic breadth-first search would have mixed the exploration of P and Q instead. The introduction of parallel (State product) operators, as well as loop iterators and local synchronizing signals make the problem more difficult (and more interesting). We propose techniques to partition statically (”at compile time”) the program body, so as to obtain a good trade-off between locality and multiplicity of steps.
Jianmin Wang - One of the best experts on this subject based on the ideXlab platform.
-
COMPSAC - A Maximum Weight Heuristic Method for Abstract State Computation
2008 32nd Annual IEEE International Computer Software and Applications Conference, 2008Co-Authors: Li Li, Xiaoyu Song, Ming Gu, Jianmin WangAbstract:Program verification is an important task in software engineering. Abstraction plays a critical role in verifying infinite State systems by model checking. We present a novel method to automatically compute the abstract Reachable State space of programs. An effective heuristic strategy is employed to find an abstract counter example, thus reducing the proof time for using theorem proving systems. In comparison with the previous work, the proposed approach demonstrates its effectiveness in predicate abstraction.
-
A Maximum Weight Heuristic Method for Abstract State Computation
2008 32nd Annual IEEE International Computer Software and Applications Conference, 2008Co-Authors: Li Li, Xiaoyu Song, Ming Gu, Jianmin WangAbstract:Program verification is an important task in software engineering. Abstraction plays a critical role in verifying infinite State systems by model checking. We present a novel method to automatically compute the abstract Reachable State space of programs. An effective heuristic strategy is employed to find an abstract counter example, thus reducing the proof time for using theorem proving systems. In comparison with the previous work, the proposed approach demonstrates its effectiveness in predicate abstraction.
Gang Feng - One of the best experts on this subject based on the ideXlab platform.
-
ISIC - New Results on Reachability Realization of Switched Impulsive Control Systems
2007 IEEE 22nd International Symposium on Intelligent Control, 2007Co-Authors: Zhijian Ji, Gang FengAbstract:This paper studies construction of switching sequences for reachability realization of switched impulsive control systems. An approach is proposed to design switching sequences so that the Reachable subspace of switched impulsive control systems is expressed in terms of the Reachable State sets of the designed switching sequences. For a class of switched impulsive control systems, it is proved that a single switching sequence can be designed with its Reachable State set coinciding with the Reachable subspace. The results present a new point of view for switching mechanism involved in the reachability and controllability of switched impulsive control systems.
-
New Results on Reachability Realization of Switched Impulsive Control Systems
2007 IEEE 22nd International Symposium on Intelligent Control, 2007Co-Authors: Zhijian Ji, Gang FengAbstract:This paper studies construction of switching sequences for reachability realization of switched impulsive control systems. An approach is proposed to design switching sequences so that the Reachable subspace of switched impulsive control systems is expressed in terms of the Reachable State sets of the designed switching sequences. For a class of switched impulsive control systems, it is proved that a single switching sequence can be designed with its Reachable State set coinciding with the Reachable subspace. The results present a new point of view for switching mechanism involved in the reachability and controllability of switched impulsive control systems.
