Logic for Concurrency and Synchronisation: 18 - Rilegato

 
9781402012709: Logic for Concurrency and Synchronisation: 18
Rilegato
ISBN 10: 1402012705 ISBN 13: 9781402012709
Casa editrice: Kluwer Academic Pub, 2003

Sinossi

This book is for researchers in computer science, mathematical logic, and philosophical logic. It shows the state of the art in current investigations of process calculi with mainly two major paradigms at work: linear logic and modal logic. The combination of approaches and pointers for further integration also suggests a grander vision for the field.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

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. Déharbe. 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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Kluwer Academic Pub
Data di pubblicazione
2003
Lingua
Inglese
ISBN 10 
1402012705
ISBN 13 
9781402012709
Rilegatura
Copertina rigida
Numero di pagine
284
Redattore
De Queiroz Ruy J. G. B.
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Altre edizioni note dello stesso titolo

9789401740005: Logic for Concurrency and Synchronisation: 18

Edizione in evidenza

ISBN 10:  9401740003 ISBN 13:  9789401740005
Casa editrice: Springer, 2013
Brossura