Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
A structural linearization principle for processes
Formal Methods in System Design
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
Modelling Asynchrony with a Synchronous Model
Proceedings of the 7th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSE
PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSE
Modelling Asynchrony with a Synchronous Model
Formal Methods in System Design
| Hi-index | 0.00 |
Modeling distributed computer systems is known to be a challenging enterprise. Typically, distributed systems are comprised of large numbers of components whose coordination may require complexinteractions. Modeling such systemsmore often than not leads to the nominal intractability of the resulting state space.Various formal methods have been proposed to address the modeling of coordination among distributed systems components. For the most part, however, these methods do not support formal verificationmechanisms.By way of contrast, the {\em L-automata/L-processes} model supports formal verification mechanisms which in many examples cansuccessfully circumvent state spaceexplosion problems, and allow verification proofs to be extended to anarbitrary number of components.After reviewing L-automata/L-processes formalisms, we present here the formal specification ofa fault-tolerant algorithm for a distributed computer system.We also expose the L-automata/L-processesverification of the distributed system, demonstrating how various techniques such ashomomorphic reduction, induction, and linearization, can be used to overcomevarious problems which surface as one models large, complex systems.