English
Related papers

Related papers: An Asynchronous Automata Approach to the Semantics…

200 papers

The paper is concerned with defining the electrical signals and their models. The delays are discussed, the asynchronous automata - which are the models of the asynchronous circuits - and the examples of the clock generator and of the R-S…

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time,…

Logic in Computer Science · Computer Science 2011-01-11 Julien Cristau

This paper introduces operators, semantics, characterizations, and solution-independent conditions to guarantee temporal logic specifications for hybrid dynamical systems. Hybrid dynamical systems are given in terms of differential…

Systems and Control · Electrical Eng. & Systems 2020-06-17 Hyejin Han , Ricardo G. Sanfelice

Characterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods. While complete…

Logic in Computer Science · Computer Science 2024-04-30 Massimo Benerecetti , Laura Bozzelli , Fabio Mogavero , Adriano Peron

We write the relations that characterize the simpliest timed automaton, the inertial delay buffer, in two versions: the non-deterministic and the deterministic one, by making use of the derivatives of the R->{0,1} functions.

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios in a very effective way. In my Ph.D.…

Artificial Intelligence · Computer Science 2021-09-20 Susana Hahn

A dynamic logic ${\mathbf B}$ can be assigned to every automaton ${\mathcal A}$ without regard if ${\mathcal A}$ is deterministic or nondeterministic. This logic enables us to formulate observations on ${\mathcal A}$ in the form of composed…

Logic in Computer Science · Computer Science 2018-09-13 Ivan Chajda , Jan Paseka

We establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the…

Formal Languages and Automata Theory · Computer Science 2018-05-18 Fabian Reiter

In the paper we define and characterize the asynchronous systems from the point of view of their autonomy, determinism, order, non-anticipation, time invariance, symmetry, stability and other important properties. The study is inspired by…

Hardware Architecture · Computer Science 2014-11-17 Serban E. Vlad

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…

Logic in Computer Science · Computer Science 2015-03-13 Carlo A. Furia , Matteo Rossi

Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward time directions. This notion, found in physical theories, has…

Discrete Mathematics · Computer Science 2010-12-08 Andrés Moreira , Anahi Gajardo

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…

Logic in Computer Science · Computer Science 2015-07-01 Pawel Parys , Igor Walukiewicz

Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically…

Logic in Computer Science · Computer Science 2015-05-18 Samuel Mimram

Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…

Logic in Computer Science · Computer Science 2024-03-29 Alexandru Baltag , Johan van Benthem , Dazhu Li

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…

Logic in Computer Science · Computer Science 2015-03-17 Ahmet Kara , Thomas Schwentick , Thomas Zeume

This article studies the solutions of time-dependent differential inclusions which is motivated by their utility in the modeling of certain physical systems. The differential inclusion is described by a time-dependent set-valued mapping…

Optimization and Control · Mathematics 2021-07-05 Kanat Camlibel , Luigi Iannelli , Aneel Tanwani

This paper presents an algorithmic framework for control synthesis of continuous dynamical systems subject to signal temporal logic (STL) specifications. We propose a novel algorithm to obtain a time-partitioned finite automaton from an STL…

Systems and Control · Electrical Eng. & Systems 2022-10-05 Qi Heng Ho , Roland B. Ilyes , Zachary N. Sunberg , Morteza Lahijanian

The synchronization problem is investigated for the class of locally strongly transitive automata introduced in a previous work of the authors. Some extensions of this problem related to the notions of stable set and word of minimal rank of…

Formal Languages and Automata Theory · Computer Science 2011-11-24 Arturo Carpi , Flavio D'Alessandro
‹ Prev 1 2 3 10 Next ›