Sciweavers

261 search results - page 30 / 53
» Detecting Temporal Logic Predicates on Distributed Computati...
Sort
View
AAMAS
1999
Springer
13 years 8 months ago
Verifying Compliance with Commitment Protocols
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
Mahadevan Venkatraman, Munindar P. Singh
WISE
2007
Springer
14 years 3 months ago
Modeling Distributed Events in Data-Intensive Rich Internet Applications
Abstract. Rich Internet applications (RIAs) enable novel usage scenarios by overcoming the traditional paradigms of Web interaction. Conventional Web applications can be seen as re...
Giovanni Toffetti Carughi, Sara Comai, Alessandro ...
IPPS
2006
IEEE
14 years 3 months ago
Design flow for optimizing performance in processor systems with on-chip coarse-grain reconfigurable logic
A design flow for processor platforms with on-chip coarse-grain reconfigurable logic is presented. The reconfigurable logic is realized by a 2-Dimensional Array of Processing Elem...
Michalis D. Galanis, Grigoris Dimitroulakos, Const...
IPPS
2003
IEEE
14 years 2 months ago
A Novel Design Technology for Next Generation Ubiquitous Computing Architecture
Modern applications for mobile computing require high performance architectures. On the other hand, there are restrictions such as storage or power consumption. The use of reconï¬...
Carsten Nitsch, Camillo Lara, Udo Kebschull
CONCUR
2000
Springer
14 years 17 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko