Real-Time Synthesis is Hard!

We study the reactive synthesis problem (RS) for specifications given in Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very general setting, but on infinite words only; and only the very restrictive BRRS subcase is known to be decidable (see D'Souza et al. and Bouyer et al.). In this paper, we precise the decidability border of MITL synthesis. We show RS is undecidable on finite words too, and present a landscape of restrictions (both on the logic and on the possible controllers) that are still undecidable. On the positive side, we revisit BRRS and introduce an efficient on-the-fly algorithm to solve it

Care coordination in a business-to-business and a business-to-consumer model for telemonitoring patients with chronic diseases

Introduction For telemonitoring to support care coordination, a sound business model is conditional. The aim of this study is to explore the systemic and economic differences in care coordination via business-to-business and business-to-consumer models for telemonitoring patients with chronic diseases. Methods We performed a literature search in order to design the business-to-business and business-to-consumer telemonitoring models, and to assess the design elements and themes by applying the activity system theory, and describe the transaction costs in each model. The design elements are content, structure, and governance, while the design themes are novelty, lock-in, complementarities, and efficiency. In the transaction cost analysis, we looked into all the elements of a transaction in both models. Results Care coordination in the business-to-business model is designed to be organized between the places of activity, rather than the participants in the activity. The design of the business-to-business model creates a firm lock-in but for a limited time. In the business-to-consumer model, the interdependencies are to be found between the persons in the care process and not between the places of care. The differences between the models were found in both the design elements and the design themes. Discussion Care coordination in the business-to-business and business-to-consumer models for telemonitoring chronic diseases differs in principle in terms of design elements and design themes. Based on the theoretical models, the transaction costs could potentially be lower in the business-to-consumer model than in the business-to-business, which could be a promoting economic principle for the implementation of telemonitoring

Quantitative Regular Expressions for Arrhythmia Detection Algorithms

Motivated by the problem of verifying the correctness of arrhythmia-detection algorithms, we present a formalization of these algorithms in the language of Quantitative Regular Expressions. QREs are a flexible formal language for specifying complex numerical queries over data streams, with provable runtime and memory consumption guarantees. The medical-device algorithms of interest include peak detection (where a peak in a cardiac signal indicates a heartbeat) and various discriminators, each of which uses a feature of the cardiac signal to distinguish fatal from non-fatal arrhythmias. Expressing these algorithms' desired output in current temporal logics, and implementing them via monitor synthesis, is cumbersome, error-prone, computationally expensive, and sometimes infeasible. In contrast, we show that a range of peak detectors (in both the time and wavelet domains) and various discriminators at the heart of today's arrhythmia-detection devices are easily expressible in QREs. The fact that one formalism (QREs) is used to describe the desired end-to-end operation of an arrhythmia detector opens the way to formal analysis and rigorous testing of these detectors' correctness and performance. Such analysis could alleviate the regulatory burden on device developers when modifying their algorithms. The performance of the peak-detection QREs is demonstrated by running them on real patient data, on which they yield results on par with those provided by a cardiologist.Comment: CMSB 2017: 15th Conference on Computational Methods for Systems Biolog

Labour Market and Social Policy in Italy: Challenges and Changes. Bertelsmann Policy Brief #2016/02

vEight years after the outbreak of the financial crisis, Italy has still to cope with and overcome a plethora of economic and social challenges. On top of this, it faces an unfavourable demographic structure and severe disparities between its northern and southern regions. Some promising reforms have recently been enacted, specifically targeting poverty and social exclusion. However, much more remains to be done on the way towards greater economic stability and widely shared prosperity

A compositional monitoring framework for hard real-time systems

Runtime Monitoring of hard real-time embedded systems is a promising technique for ensuring that a running system respects timing constraints, possibly combined with faults originated by the software and/or hardware. This is particularly important when we have real-time embedded systems made of several components that must combine different levels of criticality, and different levels of correctness requirements. This paper introduces a compositional monitoring framework coupled with guarantees that include time isolation and the response time of a monitor for a predicted violation. The kind of monitors that we propose are automatically generated by synthesizing logic formulas of a timed temporal logic, and their correctness is ensured by construction.This work was partially supported by National Funds through FCT (Portuguese Foundation for Science and Technology) and by ERDF (European Regional Development Fund) through COMPETE (Operational Programme ’Thematic Factors of Competitiveness’), within projects Ref. FCOMP-01-0124-FEDER-022701 (CISTER), FCOMP-01-0124- FEDER-015006 (VIPCORE) and FCOMP-01-0124-FEDER-020486 (AVIACC)

A Theory of Sampling for Continuous-time Metric Temporal Logic

This paper revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. The relationship between the satisfiability of Metric Temporal Logic (MTL) formulas over continuous-time models and over discrete-time models is studied. It is shown to what extent discrete-time sequences obtained by sampling continuous-time signals capture the semantics of MTL formulas over the two time domains. The main results apply to "flat" formulas that do not nest temporal operators and can be applied to the problem of reducing the verification problem for MTL over continuous-time models to the same problem over discrete-time, resulting in an automated partial practically-efficient discretization technique.Comment: Revised version, 43 pages

RTLola Cleared for Take-Off: Monitoring Autonomous Aircraft

The autonomous control of unmanned aircraft is a highly safety-critical domain with great economic potential in a wide range of application areas, including logistics, agriculture, civil engineering, and disaster recovery. We report on the development of a dynamic monitoring framework for the DLR ARTIS (Autonomous Rotorcraft Testbed for Intelligent Systems) family of unmanned aircraft based on the formal specification language RTLola. RTLola is a stream-based specification language for real-time properties. An RTLola specification of hazardous situations and system failures is statically analyzed in terms of consistency and resource usage and then automatically translated into an FPGA-based monitor. Our approach leads to highly efficient, parallelized monitors with formal guarantees on the noninterference of the monitor with the normal operation of the autonomous system

Extending the Business-to-Business (B2B) model towards a Business-to-Consumer (B2C) model for Telemonitoring Patients with Chronic Heart Failure

Purpose: We describe and perform an initial evaluation of the extension of the Business-to-Business model to a Business-to-Consumer model for telemonitoring of patients with chronic heart failure. Design/methodology/approach: We explored the problems in implementation of telemonitoring via the B2B model by means of a root cause analysis, including the 5-whys method to help us understand the shortcomings of the B2B approach, and then the 5W1H method to explore whether the B2C is a better strategy. The extension of the model was executed in the Business Model Generation framework. By using qualitative content analysis techniques, we supported our argumentation with findings from other studies. Findings: The B2C model is based on the interplay of agents – healthcare provider, equipment manufacturer, payer/regulator and distributor/promotor – all working together to improve patient outcomes. In our opinion, the success of the extended model in telemonitoring CHF patients hinges on two entities – the Telemonitoring center and Telehealth nurses – being repositioned in the out-of-the hospital setting. Social implications: Penetration of mobile telehealth via B2C model will allow for greater availability, access and equity in healthcare. Originality/value: We introduced a fourth pillar to the existing B2B model (i.e. distributors and/or promotors). The B2C model we propose might allow for scalability, generalizability and transferability of telemonitoring currently unattained with the B2B model. &nbsp

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)

The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness up to bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of) Kleene's star operation.Comment: In Proceedings EXPRESS'10, arXiv:1011.601

Specifying message passing systems requires extending temporal logic

We prove that it is impossible to express asynchronous message passing within the framework of first-order temporal logic with both future and past operators (as studied by Kamp). This is an extension of a result of Sistla et al. that unbounded buffers cannot be expressed in linear time temporal logic. In our analysis the source of this inexpressiveness is the impossibility to couple each message that is delivered by a message passing system to auniquemessage accepted by that system. This result seems to necessitate the enrichment of TL-based formalisms, e.g. with auxiliary data structures or histories as done, respectively, by Lamport and Hailpern. Observe that Lamport employs a hybrid formalism (TL+Data Structures), and that in Hailpern's method similar systems, such as FIFO and LIFO, do not have similar specifications. We shall prove that no such enrichment is logically required. This is done by introducing an additional axiom within TL which formalizes the assumption that messages accepted by the system can be uniquely identified. In this way, no extraneous formalisms are introduced, and both FIFO and LIFO are expressible with equal ease