40,289 research outputs found
Adding Priority to Event Structures
Event Structures (ESs) are mainly concerned with the representation of causal
relationships between events, usually accompanied by other event relations
capturing conflicts and disabling. Among the most prominent variants of ESs are
Prime ESs, Bundle ESs, Stable ESs, and Dual ESs, which differ in their
causality models and event relations. Yet, some application domains require
further kinds of relations between events. Here, we add the possibility to
express priority relationships among events.
We exemplify our approach on Prime, Bundle, Extended Bundle, and Dual ESs.
Technically, we enhance these variants in the same way. For each variant, we
then study the interference between priority and the other event relations.
From this, we extract the redundant priority pairs-notably differing for the
types of ESs-that enable us to provide a comparison between the extensions. We
also exhibit that priority considerably complicates the definition of partial
orders in ESs.Comment: In Proceedings EXPRESS/SOS 2013, arXiv:1307.690
Evaluating Lifeworld as an emancipatory methodology
Disability research is conducted within a highly politicised āhotbedā of competing paradigms and principles. New researchers, who want to work within the social model, are soon faced with complex and challenging methodological and philosophical dilemmas. The social model advocates research agendas that are focused on the emancipation and empowerment of disabled people but, in reality, these are rarely achieved. To be successful researchers need to engage with innovative and creative methodologies and to share their experiences of these within environments that welcome challenge and debate. This paper focuses on Lifeworld and assesses its value as a tool for emancipatory research. Using examples from a study with parents, whose children were in the process of being labelled as having autism, the paper illustrates how the principles that āunderpinā the methodology offered a supportive framework for a novice researcher
Building Responsive Systems from Physically-correct Specifications
Predictability - the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements - is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications.
The backbone of our methodology is the Time-constrained Reactive Automaton (TRA) formalism, which adopts a fundamental notion of space and time that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA model, unrealistic systems - possessing properties such as clairvoyance, caprice, in finite capacity, or perfect timing - cannot even be specified. We argue that this "ounce of prevention" at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems - not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed.
The TRA model is presented to system developers through the CLEOPATRA programming language. CLEOPATRA features a C-like imperative syntax for the description of computation, which makes it easier to incorporate in applications already using C. It is event-driven, and thus appropriate for embedded process control applications. It is object-oriented and compositional, thus advocating modularity and reusability. CLEOPATRA is semantically sound; its objects can be transformed, mechanically and unambiguously, into formal TRA automata for verification purposes, which can be pursued using model-checking or theorem proving techniques. Since 1989, an ancestor of CLEOPATRA has been in use as a specification and simulation language for embedded time-critical robotic processes.Harvard University; DARPA (N00039-88-C-0163
Language and tool support for event refinement structures in Event-B
Event-B is a formal method for modelling and verifying the consistency of chains of model refinements. The event refinement structure (ERS) approach augments Event-B with a graphical notation which is capable of explicit representation of control flows and refinement relationships. In previous work, the ERS approach has been evaluated manually in the development of two large case studies, a multimedia protocol and a spacecraft sub-system. The evaluation results helped us to extend the ERS constructors, to develop a systematic definition of ERS, and to develop a tool supporting ERS. We propose the ERS language which systematically defines the semantics of the ERS graphical notation including the constructors. The ERS tool supports automatic construction of the Event-B models in terms of control flows and refinement relationships. In this paper we outline the systematic definition of ERS including the presentation of constructors, the tool that supports it and evaluate the contribution that ERS and its tool make. Also we present how the systematic definition of ERS and the corresponding tool can ensure a consistent encoding of the ERS diagrams in the Event-B models
Individual flip-flops with gated clocks for low power datapaths
Energy consumption has become one of the important factors in digital systems, because of the requirement to dissipate this energy in high-density circuits and to extend the battery life in portable systems such as devices with wireless communication capabilities. Flip-flops are one of the most energy-consuming components of digital circuits. This paper presents techniques to reduce energy consumption by individually deactivating the clock when flip-flops do not have to change their value. Flip-flop structures are proposed and selection criteria given to obtain minimum energy consumption. The structures have been evaluated using energy models and validated by switch-level simulations. For the applications considered, significant energy reductions are achieved.Peer ReviewedPostprint (published version
Supervisor Localization of Discrete-Event Systems based on State Tree Structures
Recently we developed supervisor localization, a top-down approach to
distributed control of discrete-event systems in the Ramadge-Wonham supervisory
control framework. Its essence is the decomposition of monolithic (global)
control action into local control strategies for the individual agents. In this
paper, we establish a counterpart supervisor localization theory in the
framework of State Tree Structures, known to be efficient for control design of
very large systems. In the new framework, we introduce the new concepts of
local state tracker, local control function, and state-based local-global
control equivalence. As before, we prove that the collective localized control
behavior is identical to the monolithic optimal (i.e. maximally permissive) and
nonblocking controlled behavior. In addition, we propose a new and more
efficient localization algorithm which exploits BDD computation. Finally we
demonstrate our localization approach on a model for a complex semiconductor
manufacturing system
- ā¦