Sciweavers

62 search results - page 7 / 13
» Boolean Abstraction for Temporal Logic Satisfiability
Sort
View
VLDB
1992
ACM
116views Database» more  VLDB 1992»
15 years 1 months ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
86
Voted
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 3 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
AUSAI
2003
Springer
15 years 1 months ago
Decidability of Propositionally Quantified Logics of Knowledge
Abstract. Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with lo...
Tim French
124
Voted
ICCS
2007
Springer
15 years 1 months ago
Building Verifiable Sensing Applications Through Temporal Logic Specification
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ana...
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
14 years 10 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith