Van medisch bewijs

Rede uitgesproken bij de aanvaarding van het ambt van gewoon hoogleraar in de inwendige geneeskunde aan de Medische Faculteit Rotterdam op 5 juni 196

Effective representation of RT-LOTOS terms by finite time petri nets

The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1]. The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS

Refinement Modal Logic

In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition to the standard modalities 'box' for each agent. The operator 'all' acts as a quantifier over the set of all refinements of a given model. As a variation on a bisimulation quantifier, this refinement operator or refinement quantifier 'all' can be seen as quantifying over a variable not occurring in the formula bound by it. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second-order quantification. We present a sound and complete axiomatization of multi-agent refinement modal logic. We also present an extension of the logic to the modal mu-calculus, and an axiomatization for the single-agent version of this logic. Examples and applications are also discussed: to software verification and design (the set of agents can also be seen as a set of actions), and to dynamic epistemic logic. We further give detailed results on the complexity of satisfiability, and on succinctness

Het verhaal van Demeter en Persephone:mythen als spiegel van de relatie tussen de seksen

Deze lesbrief gaat in op de mythe van Demeter en Persephone en bestaat uit een inleiding op de mythe, een vertaling van de homerische hymne van de hand van Hilda Oudemans en enkele stukjes grondtekst

Evaluations of epistemic components for resolving the muddy children puzzle

We evaluate the 3 child muddy children puzzle using the epistemic logic of shallow depths GL. This system is used to evaluate what components are necessary for a resolution. These components include the basic beliefs of a child, the necessary depths of the epistemic structures, and the observations about the inactions of others added after a stage. These are all given explicitly, and their necessity is examined. We formulate the concept of a resolution as a process of inferences, actions, observations, and belief changes. We give three theorems. The first one gives a specific resolution, in which no common knowledge is involved. The second theorem states that any resolution has length of at least 3. The third theorem shows that the resolution given in the first theorem is minimal in various senses. In this manner, the necessary components for a resolution of the puzzle are evaluated