Sciweavers

61 search results - page 6 / 13
» Model Checking Almost All Paths Can Be Less Expensive Than C...
Sort
View
RSS
2007
135views Robotics» more  RSS 2007»
13 years 8 months ago
Learning omnidirectional path following using dimensionality reduction
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
J. Zico Kolter, Andrew Y. Ng
TSE
2011
134views more  TSE 2011»
13 years 2 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
FORTE
2004
13 years 8 months ago
Witness and Counterexample Automata for ACTL
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
INFSOF
2007
104views more  INFSOF 2007»
13 years 7 months ago
A state-based approach to integration testing based on UML models
: Correct functioning of object-oriented software depends upon the successful integration of classes. While individual classes may function correctly, several new faults can arise ...
Shaukat Ali, Lionel C. Briand, Muhammad Jaffar-Ur ...
SENSYS
2003
ACM
14 years 19 days ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak