Distributed Computing
Predicate calculus and program semantics
Predicate calculus and program semantics
win and sin: predicate transformers for concurrency
ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Interleaving set temporal logic
Theoretical Computer Science
A predicate transformer approach to knowledge and knowledge-based protocols (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Theorems on Computations of Distributed Systems
Theorems on Computations of Distributed Systems
Concurrent common knowledge: defining agreement for asynchronous systems
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Distributed Predicate Detection in Series-Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Detecting Temporal Logic Predicates on the Happened-Before Model
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
(Im)Possibilities of Predicate Detection in Crash-Affected Systems
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Detecting global predicates in distributed systems with clocks
Distributed Computing
Causality and atomicity in distributed computations
Distributed Computing
Detection of global predicates: techniques and their limitations
Distributed Computing
Intractability results in predicate detection
Information Processing Letters
Algorithmic combinatorics based on slicing posets
Theoretical Computer Science
Formal Verification of Simulation Traces Using Computation Slicing
IEEE Transactions on Computers
Solving Computation Slicing Using Predicate Detection
IEEE Transactions on Parallel and Distributed Systems
Data-stream-based global event monitoring using pairwise interactions
Journal of Parallel and Distributed Computing
Testing Distributed Systems Through Symbolic Model Checking
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Intractability results in predicate detection
Information Processing Letters
Modeling and analyzing periodic distributed computations
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A lattice-theoretic approach to runtime property detection for pervasive context
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
Programming for modular reconfigurable robots
Programming and Computing Software
FM'06 Proceedings of the 14th international conference on Formal Methods
Analysis of interval-based global state detection
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Modeling, analyzing and slicing periodic distributed computations
Information and Computation
| Hi-index | 0.00 |
The definitions of the predicates Possibly &fgr; and Definitely &fgr;, where &fgr; is a global predicate of a distributed computation, lead to the definitions of two predicate transformers P and D. We show that P plays the same role with respect to time as the predicate transformers Ki in knowledge theory play with respect to space. Pursuing this analogy, we prove that local predicates are exactly the fixed points of the Ki's while the stable predicates are the fixed points of P. In terms of the predicate transformers P and D, we define a new class of predicates that we call observer-independent predicates and for which the detection of Possibly &fgr; and Definitely &fgr; is quite easy. Finally, we establish a temporal counterpart to the knowledge change theorem of Chandy and Misra which formally proves that the global view of a distributed system provided by its various observations does not differ too much from its truth behavior.