Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Reasoning about Layered Message Passing Systems
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Plug-and-Play Architectural Design and Verification
Architecting Dependable Systems V
Decentralized runtime analysis of multithreaded applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Safe composition of distributed programs communicating over order-preserving imperfect channels
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Reasoning about layered message passing systems
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
We consider the problem of reasoning about message based systems in finite state environments. Two notions of finite state environments are discussed: bounded buffers and implicit buffers. The former notion is standard, whereby the sender gets blocked when the buffer is full. In the latter, the sender proceeds as if the buffer were unbounded, but the system has bounded memory and hence "forgets" some of the messages. The computations of such systems are given as communication diagrams. We present a linear time temporal logic which is interpreted on n-agent diagrams. The formulas of the logic specify local properties using standard temporal modalities and a basic communication modality. The satisfiability and model checking problems for the logic are shown to be decidable for both buffered products and implicit products. An example of system specification in the logic is discussed.