Explaining Violation Traces with Finite State Natural Language Generation Models

An essential element of any verification technique is that of identifying and communicating to the user, system behaviour which leads to a deviation from the expected behaviour. Such behaviours are typically made available as long traces of system actions which would benefit from a natural language explanation of the trace and especially in the context of business logic level specifications. In this paper we present a natural language generation model which can be used to explain such traces. A key idea is that the explanation language is a CNL that is, formally speaking, regular language susceptible transformations that can be expressed with finite state machinery. At the same time it admits various forms of abstraction and simplification which contribute to the naturalness of explanations that are communicated to the user

Effect of the orientational relaxation on the collective motion of patterns formed by self-propelled particles

We investigate the collective behavior of self-propelled particles (SPPs) undergoing competitive processes of pattern formation and rotational relaxation of their self-propulsion velocities. In full accordance with previous work, we observe transitions between different steady states of the SPPs caused by the intricate interplay among the involved effects of pattern formation, orientational order, and coupling between the SPP density and orientation fields. Based on rigorous analytical and numerical calculations, we prove that the rate of the orientational relaxation of the SPP velocity field is the main factor determining the steady states of the SPP system. Further, we determine the boundaries between domains in the parameter plane that delineate qualitatively different resting and moving states. In addition, we analytically calculate the collective velocity $\vec{v}$ of the SPPs and show that it perfectly agrees with our numerical results. We quantitatively demonstrate that $\vec{v}$ does not vanish upon approaching the transition boundary between the moving pattern and homogeneous steady states.Comment: 3 Figure

Hubble Space Telescope Imaging of the Expanding Nebular Remnant of the Recurrent Nova RS Ophiuchi (2006)

We report Hubble Space Telescope imaging obtained 155 days after the 2006 outburst of RS Ophiuchi. We detect extended emission in both [O III] and [Ne V] lines. In both lines, the remnant has a double ring structure. The E-W orientation and total extent of these structures (580+-50 AU at d=1.6kpc) is consistent with that expected due to expansion of emitting regions imaged earlier in the outburst at radio wavelengths. Expansion at high velocity appears to have been roughly constant in the E-W direction (v_{exp} = 3200+-300 km/s in the plane of the sky), with tentative evidence of deceleration N-S. We present a bipolar model of the remnant whose inclination is consistent with that of the central binary. The true expansion velocities of the polar components are then v = 5600+-1100 km/s. We suggest that the bipolar morphology of the remnant results from interaction of the outburst ejecta with a circumstellar medium that is significantly denser in the equatorial regions of the binary than at the poles. This is also consistent with observations of shock evolution in the X-ray and the possible presence of dust in the infrared. Furthermore, it is in line with models of the shaping of planetary nebulae with close binary central systems, and also with recent observations relating to the progenitors of Type Ia supernovae, for which recurrent novae are a proposed candidate. Our observations also reveal more extended structures to the S and E of the remnant whose possible origin is briefly discussed.Comment: 13 pages, 2 figures, accepted for publication in ApJ

Conceptual graph-based knowledge representation for supporting reasoning in African traditional medicine

Although African patients use both conventional or modern and traditional healthcare simultaneously, it has been proven that 80% of people rely on African traditional medicine (ATM). ATM includes medical activities stemming from practices, customs and traditions which were integral to the distinctive African cultures. It is based mainly on the oral transfer of knowledge, with the risk of losing critical knowledge. Moreover, practices differ according to the regions and the availability of medicinal plants. Therefore, it is necessary to compile tacit, disseminated and complex knowledge from various Tradi-Practitioners (TP) in order to determine interesting patterns for treating a given disease. Knowledge engineering methods for traditional medicine are useful to model suitably complex information needs, formalize knowledge of domain experts and highlight the effective practices for their integration to conventional medicine. The work described in this paper presents an approach which addresses two issues. First it aims at proposing a formal representation model of ATM knowledge and practices to facilitate their sharing and reusing. Then, it aims at providing a visual reasoning mechanism for selecting best available procedures and medicinal plants to treat diseases. The approach is based on the use of the Delphi method for capturing knowledge from various experts which necessitate reaching a consensus. Conceptual graph formalism is used to model ATM knowledge with visual reasoning capabilities and processes. The nested conceptual graphs are used to visually express the semantic meaning of Computational Tree Logic (CTL) constructs that are useful for formal specification of temporal properties of ATM domain knowledge. Our approach presents the advantage of mitigating knowledge loss with conceptual development assistance to improve the quality of ATM care (medical diagnosis and therapeutics), but also patient safety (drug monitoring)

Towards Model Checking of Implantable Cardioverter Defibrillators

Ventricular Fibrillation is a disorganized electrical excitation of the heart that results in inadequate blood flow to the body. It usually ends in death within a minute. A common way to treat the symptoms of fibrillation is to implant a medical device, known as an Implantable Cardioverter Defibrillator (ICD), in the patient\u27s body. Model-based verification can supply rigorous proofs of safety and efficacy. In this paper, we build a hybrid system model of the human heart+ICD closed loop, and show it to be a STORMED system, a class of o-minimal hybrid systems that admit finite bisimulations. In general, it may not be possible to compute the bisimulation. We show that approximate reachability can yield a finite simulation for STORMED systems, and that certain compositions respect the STORMED property. The results of this paper are theoretical and motivate the creation of concrete model checking procedures for STORMED systems

Incomplete Transition Complexity of Basic Operations on Finite Languages

The state complexity of basic operations on finite languages (considering complete DFAs) has been in studied the literature. In this paper we study the incomplete (deterministic) state and transition complexity on finite languages of boolean operations, concatenation, star, and reversal. For all operations we give tight upper bounds for both description measures. We correct the published state complexity of concatenation for complete DFAs and provide a tight upper bound for the case when the right automaton is larger than the left one. For all binary operations the tightness is proved using family languages with a variable alphabet size. In general the operational complexities depend not only on the complexities of the operands but also on other refined measures.Comment: 13 page

Modelling and analyzing adaptive self-assembling strategies with Maude

Building adaptive systems with predictable emergent behavior is a challenging task and it is becoming a critical need. The research community has accepted the challenge by introducing approaches of various nature: from software architectures, to programming paradigms, to analysis techniques. We recently proposed a conceptual framework for adaptation centered around the role of control data. In this paper we show that it can be naturally realized in a reflective logical language like Maude by using the Reflective Russian Dolls model. Moreover, we exploit this model to specify, validate and analyse a prominent example of adaptive system: robot swarms equipped with self-assembly strategies. The analysis exploits the statistical model checker PVeStA