Towards Generic Monitors for Object-Oriented Real-Time Maude Specifications

Non-Functional Properties (NFPs) are crucial in the design of software. Specification of systems is used in the very first phases of the software development process for the stakeholders to make decisions on which architecture or platform to use. These specifications may be an- alyzed using different formalisms and techniques, simulation being one of them. During a simulation, the relevant data involved in the anal- ysis of the NFPs of interest can be measured using monitors. In this work, we show how monitors can be parametrically specified so that the instrumentation of specifications to be monitored can be automatically performed. We prove that the original specification and the automati- cally obtained specification with monitors are bisimilar by construction. This means that the changes made on the original system by adding monitors do not affect its behavior. This approach allows us to have a library of possible monitors that can be safely added to analyze different properties, possibly on different objects of our systems, at will.Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tech. Spanish MINECO/FEDER project TIN2014-52034-R, NSF Grant CNS 13-19109

State space c-reductions for concurrent systems in rewriting logic

We present c-reductions, a state space reduction technique. The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system. This is done by means of a canonizer function, which maps each state into a (non necessarily unique) canonical representative of its equivalence class. The approach exploits the expressiveness of rewriting logic and its realization in Maude to enjoy several advantages over similar approaches: exibility and simplicity in the definition of the reductions (supporting not only traditional symmetry reductions, but also name reuse and name abstraction); reasoning support for checking and proving correctness of the reductions; and automatization of the reduction infrastructure via Maude's meta-programming features. The approach has been validated over a set of representative case studies, exhibiting comparable results with respect to other tools

Maude: specification and programming in rewriting logic

Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude

Dust Emission from Active Galactic Nuclei

Unified schemes of active galactic nuclei (AGN) require an obscuring dusty torus around the central source, giving rise to Seyfert 1 line spectrum for pole-on viewing and Seyfert 2 characteristics in edge-on sources. Although the observed IR is in broad agreement with this scheme, the behavior of the 10 micron silicate feature and the width of the far-IR emission peak remained serious problems in all previous modeling efforts. We show that these problems find a natural explanation if the dust is contained in about 5-10 clouds along radial rays through the torus. The spectral energy distributions (SED) of both type 1 and type 2 sources are properly reproduced from different viewpoints of the same object if the visual optical depth of each cloud is larger than about 60 and the clouds' mean free path increases roughly in proportion to radial distance.Comment: 11 pages, submitted to ApJ Letter

Towards the specification and verification of modal properties for structured systems

System specification formalisms should come with suitable property specification languages and effective verification tools. We sketch a framework for the verification of quantified temporal properties of systems with dynamically evolving structure. We consider visual specification formalisms like graph transformation systems (GTS) where program states are modelled as graphs, and the program behavior is specified by graph transformation rules. The state space of a GTS can be represented as a graph transition system (GTrS), i.e. a transition system with states and transitions labelled, respectively, with a graph, and with a partial morphism representing the evolution of state components. Unfortunately, GTrSs are prohibitively large or infinite even for simple systems, making verification intractable and hence calling for appropriate abstraction techniques

A Rewriting Based Model for Probabilistic Distributed Object Systems

Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The nondeterminism provides an abstraction over scheduling, network delays, failures and randomization. However a probabilistic model can capture these sources of nondeterminism more precisely and enable statistical analysis, simulations and reasoning. We have developed a general semantic framework for probabilistic systems using probabilistic rewriting. Our framework also allows nondeterminism in the system. In this paper, we briefly describe the framework and its application to concurrent object based systems such as actors. We also identify a su#ciently expressive fragment of the general framework and describe its implementation. The concepts are illustrated by a simple client-server example

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 and analyse a prominent example of adaptive system: robot swarms equipped with obstacle-avoidance self-assembly strategies. The analysis exploits the statistical model checker PVesta

The evolution of GX 339-4 in the low-hard state as seen by NuSTAR and Swift

We analyze eleven NuSTAR and Swift observations of the black hole X-ray binary GX 339-4 in the hard state, six of which were taken during the end of the 2015 outburst, five during a failed outburst in 2013. These observations cover luminosities from 0.5%-5% of the Eddington luminosity. Implementing the most recent version of the reflection model relxillCp, we perform simultaneous spectral fits on both datasets to track the evolution of the properties in the accretion disk including the inner edge radius, the ionization, and temperature of the thermal emission. We also constrain the photon index and electron temperature of the primary source (the "corona"). We find the disk becomes more truncated when the luminosity decreases, and observe a maximum truncation radius of $37R_g$. We also explore a self-consistent model under the framework of coronal Comptonization, and find consistent results regarding the disk truncation in the 2015 data, providing a more physical preferred fit for the 2013 observations.Comment: 15 pages, 8 figures, 6 tables, accepted for publication in The Astrophysical Journa