The automata-theoretic approach to linear temporal logic uses the theory of automata as a
unifying paradigm for program specification, verification, and synthesis. Both programs and …

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and
liveness guarantees for distributed systems that must operate in the presence of arbitrary …

Petri Nets–An Introduction [63] is a slim book that was published almost 30 years ago and
was quickly translated into six languages and sold several thousand copies. For a long time …

The concept of one event happening before another in a distributed system is examined,
and is shown to define a partial ordering of the events. A distributed algorithm is given for …

Reliable computer systems must handle malfunctioning components that give conflicting
information to different parts of the system. This situation can be expressed abstractly in …

A concurrent object is a data object shared by concurrent processes. Linearizability is a
correctness condition for concurrent objects that exploits the semantics of abstract data …

Recent archaeological discoveries on the island of Paxos reveal that the parliament
functioned despite the peripatetic propensity of its part-time legislators. The legislators …

We give an efficient procedure for verifying that a finite-state concurrent system meets a
specification expressed in a (propositional, branching-time) temporal logic. Our algorithm …

Reactive systems are computing systems which are interactive, such as real-time systems,
operating systems, concurrent systems, control systems, etc. They are among the most …

Publisher Summary This chapter discusses temporal and modal logic. The chapter
describes a multiaxis classification of systems of temporal logic. The chapter describes the …