Logic for concurrency and synchronisation

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Queiroz, Ruy J. G. B. de (ed.)
Series: Trends in logic 18
Publisher: Kluwer Acad. Publ
Year: 2003

Language: English
Pages: 284
City: Dordrecht
Tags: Modality (Logic);Parallel programming (Computer science);Proof theory.;Proof theory;Modallogik;Synchronisierung;Verteiltes System;Lineare Logik;Nebenläufigkeit;Prozess;Beweistheorie;SWD-ID: 41451776;Lineare Logik;SWD-ID: 46270668;Modallogik;SWD-ID: 40749149

Content: List of Figures. List of Tables. Foreword
J. van Benthem. Preface. Contributing Authors. I: From a Structural Perspective. 1. Geometry of Deduction via Graphs of Proofs
A. Grisi de Oliveira, R.J.B.G. Queiroz. 1. Motivation. 2. The idea of stuying proofs as geometric objects. 3. Proof-nets. 4. Logical flow graphs. 5. Multiple-conclusion classical calculi. 6. Finale. 2. Chu's Construction: A Proof-Theoretic Approach
G. Bellin. 1. Preface. 2. The trip translation. 3. Chu's construction. 4. Proof-nets, trips and translations. 3. Two Paradigms of Logical Computation in Affine Logic? G. Bellin. 1. Introduction. 2. Sequent calculus of MAL + Mix. 3. Additive mix. 4. Proof-nets for MAL + Mix. 5. Cut-elimination modulo irrelevance. 6. Symmetric reductions require Mix. 4. Proof Systems for pi-Calculus Logics
M. Dam. 1. Introduction. 2. Preliminaries on the pi-calculus. 3. A pi-mu-calculus. 4. Example specifications. 5. Proof system, modal fragment. 6. Soundness and completeness for the modal fragment. 7. Proof rules for recursive formulas. 8. Finite control completeness. 9. Natural numbers. 10. Buffers. 11. Conclusion. II: From a Descriptive Perspective. 5. A Tutorial Introduction to Symbolic Model Checking
D. Deharbe. 1. Introduction. 2. Kripke structures. 3. Temporal logic model checking.4. Symbolic model checking. 5. Loopless undirected graphs. 6. Modal definability. 7. k-Colourable graphs. 8. Conclusions. 7. Bisimulation and Language Equivalence
C. Stirling. 1. Introduction. 2. Background. 3. Caucal's hierarchy. 4. Richer logics. 5. Finite model theory.