Sciweavers

135 search results - page 8 / 27
» A Distributed Algorithm to Evaluate Quantified Boolean Formu...
Sort
View
FSTTCS
2010
Springer
13 years 5 months ago
ATL with Strategy Contexts: Expressiveness and Model Checking
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary...
Arnaud Da Costa Lopes, François Laroussinie...
JAR
2000
145views more  JAR 2000»
13 years 7 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
ENTCS
2006
121views more  ENTCS 2006»
13 years 7 months ago
A Logic for Graphs with QoS
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
GianLuigi Ferrari, Alberto Lluch-Lafuente
CIA
2007
Springer
14 years 1 months ago
Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
Avi Rosenfeld, Sarit Kraus, Charlie Ortiz
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Decentralized Monitoring of Safety in Distributed Systems
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu