Defining civilization utilizing anthropic reasoning

We utilize anthropic reasoning to demonstrate that we are typical observers of our reference class under a self-sampling assumption by investigating the definition of what a civilization is. With reference to the conflict between such reasoning and the observational lack of extra-terrestrial intelligent life, we conclude that a part of our theoretical understanding of the Universe will be at fault.

A work domain analysis framework for modelling intensive care unit patients

Work domain analysis (WDA) has been applied to a range of complex work domains, but few WDAs have been undertaken in medical contexts. One pioneering effort suggested that clinical abstraction is not based on means-ends relations, whereas another effort downplayed the role of bio-regulatory mechanisms. In this paper it is argued that bio-regulatory mechanisms that govern physiological behaviour must be part of WDA models of patients as the systems at the core of intensive care units. Furthermore it is argued that because the inner functioning of patients is not completely known, clinical abstraction is based on hypothetico-deductive abstract reasoning. This paper presents an alternative modelling framework that conforms to the broader aspirations of WDA. A modified version of the viable systems model is used to represent the patient system as a nested dissipative structure while aspects of the recognition primed decision model are used to represent the information resources available to clinicians in ways that support lsquoif...thenrsquo conceptual relations. These two frameworks come together to form the recursive diagnostic framework, which may provide a more appropriate foundation for information display design in the intensive care unit.

Logic of Violations: A gentzen systems for reasoning with contrary-to-duty obligations

In this paper we present a Gentzen system for reasoning with contrary-to-duty obligations. The intuition behind the system is that a contrary-to-duty is a special kind of normative exception. The logical machinery to formalise this idea is taken from substructural logics and it is based on the definition of a new non-classical connective capturing the notion of reparational obligation. Then the system is tested against well-known contrary-to-duty paradoxes.

Reasoning algebraically about probabilistic loops

Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calculus. We extend their work to reasoning about probabilistic loops in the probabilistic refinement calculus. We apply our algebraic reasoning to derive transformation rules for probabilistic action systems. In particular we focus on developing data refinement rules for probabilistic action systems. Our extension is interesting since some well known transformation rules that are applicable to standard programs are not applicable to probabilistic ones: we identify some of these important differences and we develop alternative rules where possible. In particular, our probabilistic action system data refinement rules are new.

Reasoning about timeouts

In real-time programming a timeout mechanism allows exceptional behaviour, such as a lack of response, to be handled effectively, while not overly affecting the programming for the normal case. For. example, in a pump controller if the water level has gone below the minimum level and the pump is on and hence pumping in more water, then the water level should rise above the minimum level within a specified time. If not, there is a fault in the system and it should be shut down and an alarm raised. Such a situation can be handled by normal case code that determines when the level has risen above the minimum, plus a timeout case handling the situation when the specified time to reach the minimum has passed. In this paper we introduce a timeout mechanism, give it a formal definition in terms of more basic real-time commands, develop a refinement law for introducing a timeout clause to implement a specification, and give an example of using the law to introduce a timeout. The framework used is a machine-independent real-time programming language, which makes use of a deadline command to represent timing constraints in a machine-independent fashion. This allows a more abstract approach to handling timeouts.

Reasoning about deadlines in concurrent real-time programs

We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machine-dependent task. The latter takes into account the execution times of the program on a particular machine. Therefore, our goal is to make the machine-dependent phase of the analysis as simple as possible. We succeed in the sense that the machine-dependent phase remains the same as in the analysis of sequential programs. We shift the complexity introduced by concurrency completely to the machine-independent phase.