Complexity of ITL model checking: some well-behaved fragments of the interval logic HS

Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics, while little work has been done in the interval temporal logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham's modal logic of time intervals HS over finite Kripke structures (under the homogeneity assumption) and an EXPSPACE model checking procedure for two meaningful fragments of it have been proposed. In this paper, we show that more efficient model checking procedures can be developed for some expressive enough fragments of HS

Event-Clock Nested Automata

In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the same closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable language-inclusion problem. In particular, we prove that emptiness, universality, and language-inclusion for ECNA are EXPTIME-complete problems. As for the expressiveness, we have that ECNA properly extend any previous attempt in the literature of combining ECA and VPA

Explosive synchronization enhanced by time-delayed coupling

We study the emergence of synchronization in scale-free networks by considering the Kuramoto model of coupled phase oscillators. The natural frequencies of oscillators are assumed to be correlated with their degrees and a time delay is included in the system. This assumption allows enhancing the explosive transition to reach the synchronous state. We provide an analytical treatment developed in a star graph which reproduces results obtained in scale-free networks. Our findings have important implications in understanding the synchronization of complex networks, since the time delay is present in most systems due to the finite speed of the signal transmission over a distance.Comment: 5 pages, 7 figure

Thrust vectoring for lateral-directional stability

The advantages and disadvantages of using thrust vectoring for lateral-directional control and the effects of reducing the tail size of a single-engine aircraft were investigated. The aerodynamic characteristics of the F-16 aircraft were generated by using the Aerodynamic Preliminary Analysis System II panel code. The resulting lateral-directional linear perturbation analysis of a modified F-16 aircraft with various tail sizes and yaw vectoring was performed at several speeds and altitudes to determine the stability and control trends for the aircraft compared to these trends for a baseline aircraft. A study of the paddle-type turning vane thrust vectoring control system as used on the National Aeronautics and Space Administration F/A-18 High Alpha Research Vehicle is also presented

Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground

In this paper, we address complexity issues for timeline-based planning over dense temporal domains. The planning problem is modeled by means of a set of independent, but interacting, components, each one represented by a number of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (synchronization rules). While the temporal domain is usually assumed to be discrete, here we consider the dense case. Dense timeline-based planning has been recently shown to be undecidable in the general case; decidability (NP-completeness) can be recovered by restricting to purely existential synchronization rules (trigger-less rules). In this paper, we investigate the unexplored area of intermediate cases in between these two extremes. We first show that decidability and non-primitive recursive-hardness can be proved by admitting synchronization rules with a trigger, but forcing them to suitably check constraints only in the future with respect to the trigger (future simple rules). More "tractable" results can be obtained by additionally constraining the form of intervals in future simple rules: EXPSPACE-completeness is guaranteed by avoiding singular intervals, PSPACE-completeness by admitting only intervals of the forms [0,a] and [b,$\infty$[.Comment: In Proceedings GandALF 2018, arXiv:1809.0241

Public Policy on Microfinance in South America

The purpose of this paper is to analyze the impact of public policies in various countries of South America on the development of microfinance (MF). A broad definition of public policy has been used in this work, as it covers specific legislation seeking to develop more inclusive financial systems; government participation in official bank programs; second-tier bank funds; the use of targeted funds and guarantee and intelligent subsidy schemes, etc. Particular attention is focused on financial system regulatory frameworks, as they tend to play a fundamental role in the success of such programs. An analysis is made of best practices recommended by international agencies, matching them against the existing framework for microfinance activities in the countries analyzed. The main conclusion that can be drawn is that despite the very varied nature of the initiatives pursued, one common element observed in all the countries surveyed is the role played by commercial banks in MF development. Nevertheless, note should be taken of the direct and indirect role played by the state in encouraging the involvement of the financial sector as the leading provider of MF, a role that is in general based on criteria of selfsustainability and commercial practices.Microfinance, Public policies

An extension of a theorem of Schoenberg to products of spheres

We present a characterization for the continuous, isotropic and positive definite kernels on a product of spheres along the lines of a classical result of I. J. Schoenberg on positive definiteness on a single sphere. We also discuss a few issues regarding the characterization, including topics for future investigation

Checking Interval Properties of Computations

Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by checking the formula against the model. Classically, system behaviour is expressed by a formula of a temporal logic, such as LTL and the like. These logics are "point-wise" interpreted, as they describe how the system evolves state-by-state. However, there are relevant properties, such as those constraining the temporal relations between pairs of temporally extended events or involving temporal aggregations, which are inherently "interval-based", and thus asking for an interval temporal logic. In this paper, we give a formalization of the model checking problem in an interval logic setting. First, we provide an interpretation of formulas of Halpern and Shoham's interval temporal logic HS over finite Kripke structures, which allows one to check interval properties of computations. Then, we prove that the model checking problem for HS against finite Kripke structures is decidable by a suitable small model theorem, and we provide a lower bound to its computational complexity.Comment: In Journal: Acta Informatica, Springer Berlin Heidelber, 201