Sciweavers

937 search results - page 50 / 188
» On the Complexity of Partial Order Properties
Sort
View
APN
1999
Springer
15 years 10 months ago
Detection of Illegal Behaviors Based on Unfoldings
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...
Jean-Michel Couvreur, Denis Poitrenaud
LCN
2005
IEEE
15 years 11 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 6 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
ISRR
2005
Springer
149views Robotics» more  ISRR 2005»
15 years 11 months ago
Emergence, Exploration and Learning of Embodied Behavior
A novel model for dynamic emergence and adaptation of embodied behavior is proposed. A musculo-skeletal system is controlled by a number of chaotic elements, each of which driving...
Yasuo Kuniyoshi, Shinsuke Suzuki, Shinji Sangawa
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 2 days ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri