Sciweavers

932 search results - page 52 / 187
» Verifying Progress in Timed Systems
Sort
View
124
Voted
ATAL
2006
Springer
15 years 7 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi
128
Voted
ICRA
1995
IEEE
107views Robotics» more  ICRA 1995»
15 years 7 months ago
A Design Method of Local Communication Area in Multiple Mobile Robot System
When many mobile robots should achieve cooperation, local communication system is considered appropriate from the standpoint of the cost and capacity of communication. This paper ...
Eiichi Yoshida, Masakazu Yamamoto, Tamio Arai, Jun...
219
Voted
VLDB
2009
ACM
165views Database» more  VLDB 2009»
16 years 3 months ago
Online pairing of VoIP conversations
This paper answers the following question; given a multiplicity of evolving 1-way conversations, can a machine or an algorithm discern the conversational pairs in an online fashio...
Michail Vlachos, Aris Anagnostopoulos, Olivier Ver...
254
Voted
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 5 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
149
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 3 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...