Sciweavers

780 search results - page 54 / 156
» Compositional Quantitative Reasoning
Sort
View
PODC
1994
ACM
15 years 4 months ago
Open Systems in TLA
We describe a method for writing assumption/guarantee specifications of concurrent systems. We also provide a proof rule for reasoning about the composition of these systems. Spec...
Martín Abadi, Leslie Lamport
103
Voted
JLP
2011
160views more  JLP 2011»
14 years 7 months ago
Axiomatizability of representable domain algebras
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
Robin Hirsch, Szabolcs Mikulás
101
Voted
ECP
1997
Springer
88views Robotics» more  ECP 1997»
15 years 5 months ago
A Time and Resource Problem for Planning Architectures
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
Amedeo Cesta, Cristiano Stella
KR
1994
Springer
15 years 4 months ago
Toward a Logic for Qualitative Decision Theory
We present a logic for representing and reasoning with qualitative statements of preference and normality and describe how these may interact in decision making under uncertainty....
Craig Boutilier
112
Voted
KBSE
2003
IEEE
15 years 6 months ago
Model-based Verification of Web Service Compositions
In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. This approach provides verification of properties created fr...
Howard Foster, Sebastián Uchitel, Jeff Mage...