Algorithmic Verification of Continuous and Hybrid Systems

We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes replace an infinite number of simulations.Comment: In Proceedings INFINITY 2013, arXiv:1402.661

Robust Motion Planning employing Signal Temporal Logic

Motion planning classically concerns the problem of accomplishing a goal configuration while avoiding obstacles. However, the need for more sophisticated motion planning methodologies, taking temporal aspects into account, has emerged. To address this issue, temporal logics have recently been used to formulate such advanced specifications. This paper will consider Signal Temporal Logic in combination with Model Predictive Control. A robustness metric, called Discrete Average Space Robustness, is introduced and used to maximize the satisfaction of specifications which results in a natural robustness against noise. The comprised optimization problem is convex and formulated as a Linear Program.Comment: 6 page

Formal and Informal Methods for Multi-Core Design Space Exploration

We propose a tool-supported methodology for design-space exploration for embedded systems. It provides means to define high-level models of applications and multi-processor architectures and evaluate the performance of different deployment (mapping, scheduling) strategies while taking uncertainty into account. We argue that this extension of the scope of formal verification is important for the viability of the domain.Comment: In Proceedings QAPL 2014, arXiv:1406.156

Kant’s Rational Morality and the Mentally Impaired: The Quest for a Universal Moral Account

Kantian deontology makes at least three central claims: (1) All humans are ends in themselves, (2) All humans have moral obligations, and (3) Morality (the categorical imperative) is a rational endeavor. However, the universal claims of Kantian deontology become suspect when we consider the mentally impaired who, in some cases, cannot meet the rationality requirements implicit in the categorical imperative. In this paper, I argue that Kantian deontology cannot account for the entirety of the human population lest it exclude the mentally impaired as either non-moral agents or sub-human entities. I then suggest that by adopting the paradigm of virtue ethics, we can sufficiently avoid this problem and account for the dignity and moral agency of the mentally impaired. Finally, I consider one objection to this moral picture and respond

Kant’s Rational Morality and the Mentally Impaired: The Quest for a Universal Moral Account

Kantian deontology makes at least three central claims: (1) All humans are ends in themselves, (2) All humans have moral obligations, and (3) Morality (the categorical imperative) is a rational endeavor. However, the universal claims of Kantian deontology become suspect when we consider the mentally impaired who, in some cases, cannot meet the rationality requirements implicit in the categorical imperative. In this paper, I argue that Kantian deontology cannot account for the entirety of the human population lest it exclude the mentally impaired as either non-moral agents or sub-human entities. I then suggest that by adopting the paradigm of virtue ethics, we can sufficiently avoid this problem and account for the dignity and moral agency of the mentally impaired. Finally, I consider one objection to this moral picture and respond

Invisible pushdown languages

Context free languages allow one to express data with hierarchical structure, at the cost of losing some of the useful properties of languages recognized by finite automata on words. However, it is possible to restore some of these properties by making the structure of the tree visible, such as is done by visibly pushdown languages, or finite automata on trees. In this paper, we show that the structure given by such approaches remains invisible when it is read by a finite automaton (on word). In particular, we show that separability with a regular language is undecidable for visibly pushdown languages, just as it is undecidable for general context free languages