Epistemic Reasoning in Concurrent Systems

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Context
1.1.1 Epistemic Logic
1.1.2 Concurrency
1.2 This Thesis: Epistemic Reasoning in Concurrent Systems
1.3 Outline and Contributions
1.3.1 Part I- Epistemic Logic as a Programming Language
1.3.2 Part II- How Knowledge Evolves
1.3.3 Part III- Epistemic Strategies for Concurrent Processes
1.4 Publications
2 Preliminaries on Modal Logic 
2.1 Relational Structures and the Semantics of Modal Logic
2.2 Validity, Soundness and Completeness
2.3 Specic Modal Logics
2.3.1 Kn
2.3.2 S4
2.3.3 S5
I Epistemic Logic as a Programming Language: Epistemic Modalities in Process Calculi
Introduction
3 Preliminaries 
3.1 Domain theory
3.2 Concurrent constraint programming
3.2.1 Constraint systems
3.2.2 Processes
4 Space and Knowledge in Constraint Systems 
4.1 Spatial Constraint Systems
4.1.1 Inconsistency Connement
4.2 Epistemic Constraint Systems
4.3 Examples
5 Space and Knowledge in Processes 
5.1 Syntax
5.1.1 Basic Processes
5.1.2 Spatial Processes
5.1.3 Epistemic Processes
5.1.4 Innite Processes
5.2 Reduction Semantics
5.2.1 Operational Semantics for SCCP
5.2.2 Operational Semantics for ECCP
6 Observable Behaviour of Space and Knowledge 
6.1 Observing Limits
6.2 Observing Barbs
6.3 Denotational Semantics
7 Future Work and Conclusions 
7.1 Compact Approximation of Space and Knowledge
7.2 Related Work
7.3 Future Work
7.4 Conclusion
II How Knowledge Evolves: Epistemic Logic for Labelled Transition Systems
Introduction
8 Histories 
8.1 Labelled transition systems with agents
8.2 History Systems
9 The Logic and its Semantics 
9.1 Syntax and Models
9.2 Semantics
9.3 An example
10 A Complete Axiomatization
10.1 Axioms
10.2 Soundness and Completeness
Conclusions and Related Work
III Knowing What You Are Doing: Epistemic Strate- gies for Concurrent Processes
Introduction
11 Background 
12 Games and Strategies 
12.1 Valid Positions
12.2 Strategies
12.3 Execution of Processes According to Strategies
12.4 Epistemic Restrictions on Strategies
13 Correspondence between Strategies and Schedulers 
13.1 Background on Schedulers
13.2 Correspondence Theorem
14 Games for Processes with Probabilistic Choice 
14.1 Syntax and Semantics
14.2 Games, Valid Positions and Strategies
14.2.1 Valid Positions
14.2.2 Strategies
14.2.3 Execution of a probabilistic process with a strategy
15 A Modal Logic for Strategies 
15.1 Syntax and Semantics
15.2 Basic Properties Captured in Modal Logic
15.3 Logical Characterization of Indistinguishability Relations
15.4 Properties Following from Logical Characterizations of Equivalence Relations
Conclusions and Related Work
16 Conclusion 
Bibliography