Book ChapterDOI
A Modal Logic for a Subclass of Event Structures
Kamal Lodaya,P. S. Thiagarajan +1 more
- pp 290-303
Reads0
Chats0
TLDR
In this paper, a non-interleaved model for the behaviour of distributed computing systems, and an accompanying temporal logic with an explicit treatment of concurrency is introduced, based on a notion of local rather than global states.Abstract:
This paper introduces a non-interleaved model for the behaviour of distributed computing systems, and an accompanying temporal logic with an explicit treatment of concurrency (based on a notion of local rather than global states). A subclass of event structures (called n-agent event structures) is used as the underlying model -- intended to describe the computational behaviour of n communicating, sequential (and possibly non-deterministic) agents. The logic is centered around indexed modalities to describe the states of knowledge of the individual agents during such a computation. An axiom system for the logic is presented, and a full proof of its soundness and completeness (Henkin style proof) is given.read more
Citations
More filters
Book ChapterDOI
An introduction to event structures
TL;DR: These notes are intended to introduce the mathematical theory of event structures, show how they are related to Petri nets and Scott domains, and how they can be used to provide semantics to programming languages for parallel processes as well as languages with higher types.
BookDOI
Logics for databases and information systems
Jan Chomicki,Gunter Saake +1 more
TL;DR: 1. Introduction to Logics for Databases and Information Systems J. Chomicki, G. Saake, and Evolving Logical Specification in Information Systems S. Conrad.
Book ChapterDOI
Logics for specifying concurrent information systems
TL;DR: This chapter concentrates on a challenging problem of information system specification and design, namely how to cope on a high level of abstraction with concurrent behaviour and communication as implied by distribution.
Journal ArticleDOI
Bridging the gap between fair simulation and trace inclusion
TL;DR: It is established that fair simulation offers a complete method for checking trace inclusion for finite-state systems and a new triply nested @m-calculus formula which can be implemented by symbolic methods is presented.
Journal ArticleDOI
Specifying communication in distributed information systems
TL;DR: It is shown that $\mbox{\sf D}_1$ specifications may be automatically translated to £0 in a sound and complete way, and may be useful for making implementation platforms like Corba easier accessible by providing high-level planning and specification methods for communication.
References
More filters
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Journal ArticleDOI
Petri nets, event structures and domains, part I
TL;DR: To connect the abstract ideas of events and domains of information, it is shown how casual nets induce certain kinds of domains where the information points are certain sets of events, which allows translations between the languages of net theory and domain theory.
Journal ArticleDOI
Proving Liveness Properties of Concurrent Programs
Susan S. Owicki,Leslie Lamport +1 more
TL;DR: A formal proof method, based on temporal logic, for deriving liveness properties is presented, which allows a rigorous formulation of simple informal arguments and how to reason with temporal logic and use safety (invariance) properties in proving liveness is shown.
Journal ArticleDOI
Decision procedures and expressiveness in the temporal logic of branching time
E. A. Emerson,Joseph Y. Halpern +1 more
TL;DR: It is established that CTL has the small model property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from the small “pseudomodel” resulting from the Fischer-Ladner quotient construction.