How to Do Things With Words

List of figures and tables Acknowledgments Prologue Part I. Theory and Function: 1. The structure of emotions 2. Intuitive and empirical approaches to understanding 3. Rationality and emotions 4. Mutual plans and social emotions Part II. Conflict and Unpredictability: 5. Plans and emotions in fictional narrative 6. Stress and distress 7. Freud's cognitive psychology of intention: the case of Dora Part III. Enjoyment and Creativity: 8. Happiness 9. Putting emotions into words Epilogue Notes References Author index Subject index.

Best-Laid Schemes: A Psychology of Emotions.

Alternating-time temporal logic

Bacteria produce a wide range of exopolysaccharides which are synthesized via different biosynthesis pathways. The genes responsible for synthesis are often clustered within the genome of the respective production organism. A better understanding of the fundamental processes involved in exopolysaccharide biosynthesis and the regulation of these processes is critical toward genetic, metabolic and protein-engineering approaches to produce tailor-made polymers. These designer polymers will exhibit superior material properties targeting medical and industrial applications. Exploiting the natural design space for production of a variety of biopolymer will open up a range of new applications. Here, we summarize the key aspects of microbial exopolysaccharide biosynthesis and highlight the latest engineering approaches toward the production of tailor-made variants with the potential to be used as valuable renewable and high-performance products for medical and industrial applications.

/pdf/bacterial-exopolysaccharides-biosynthesis-pathways-and-3t1hslwdme.pdf

Bacterial exopolysaccharides: biosynthesis pathways and engineering strategies

Bacterial cellulose biosynthesis: diversity of operons, subunits, products, and functions

The papers presents the current stage of the development of VerICS - a model checker for real-time and multi-agent systems. Depending on the type of a system considered, it enables to test various classes of properties - from reachability to temporal, epistemic and deontic formulas. The model checking methods used to this aim include both SAT-based and enumerative ones. In the paper we focus on new features of the verifier: SAT-based model checking for multi-agent systems and several extensions and improvements to real-time systems' verification.

/pdf/verics-2007-a-model-checker-for-knowledge-and-real-time-2irb2ziujn.pdf

VerICS 2007 - a Model Checker for Knowledge and Real-Time

We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature.We give details of the technique and show how it can be applied to the well-known train, gate and controller problem.

Verification of Multiagent Systems via Unbounded Model Checking

Complete genome sequence of Gluconacetobacter xylinus E25 strain—Valuable and effective producer of bacterial nanocellulose ☆

We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity requirements specified. Two different model checking techniques (ordered binary decision diagrams and SAT-based bounded model checking) are evaluated and compared to verify the protocols.

/pdf/comparing-bdd-and-sat-based-techniques-for-model-checking-5cock7jy0i.pdf

Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

This paper addresses the problem of verification of temporal epistemic properties of multi-agent systems by means of symbolic model checking. An overview of the technique of bounded model checking for temporal epistemic logic, and an analysis of some limitations of the method are provided. An extension of this technique called unbounded model checking to solve these limitations is explored. Similarities and differences of the two methods are explicitly exemplified by the analysis of a scenario in the two formalisms.

Magdalena Kacprzak

Papers

VerICS 2007 - a Model Checker for Knowledge and Real-Time

Verification of Multiagent Systems via Unbounded Model Checking

Complete genome sequence of Gluconacetobacter xylinus E25 strain—Valuable and effective producer of bacterial nanocellulose ☆

Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

From Bounded to Unbounded Model Checking for Temporal Epistemic Logic