Sciweavers

2649 search results - page 258 / 530
» Temporal Theories of Reasoning
Sort
View
IAT
2008
IEEE
16 years 1 months ago
Obligations with Deadlines and Maintained Interdictions in Privacy Regulation Frameworks
We aim at providing artificial agents with logical tools to reason specifically on privacy-related regulations, in order to comply with them. In order to express these regulatio...
Guillaume Piolle, Yves Demazeau
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
16 years 7 days ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
15 years 12 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
CSL
2009
Springer
15 years 11 months ago
Upper Bounds on Stream I/O Using Semantic Interpretations
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
Marco Gaboardi, Romain Péchoux
151
Voted
KI
1997
Springer
15 years 11 months ago
Agents in Proactive Environments
Abstract. Agents situated in proactive environments are acting autonomously while the environment is evolving alongside, whether or not the agents carry out any particular actions....
Dov M. Gabbay, Rolf Nossum, Michael Thielscher