Sciweavers

397 search results - page 53 / 80
» Coalgebraic Models for Reactive Systems
Sort
View
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 2 months 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
ICPR
2004
IEEE
14 years 9 months ago
Probabilistic People Tracking for Occlusion Handling
This work presents a novel people tracking approach, able to cope with frequent shape changes and large occlusions. In particular, the tracks are described by means of probabilist...
Rita Cucchiara, Costantino Grana, Giovanni Tardini...
AAAI
1994
13 years 10 months ago
The Capacity of Convergence-Zone Episodic Memory
Abstract- Human episodic memory provides a seemingly unlimited storage for everyday experiences, and a retrieval system that allows us to access the experiences with partial activa...
Mark Moll, Risto Miikkulainen, Jonathan Abbey
LOPSTR
2009
Springer
14 years 3 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
COMPSAC
2006
IEEE
14 years 2 months ago
Automated Agent Synthesis for Situation Awareness in Service-Based Systems
Service-based systems have many applications, such as collaborative research and development, e-business, health care, military applications, and homeland security. In dynamic ser...
Stephen S. Yau, Haishan Gong, Dazhi Huang, Wei Gao...