English
Related papers

Related papers: Dynamic Input/Output Automata: a Formal and Compos…

200 papers

We propose an extension of Hybrid I/O Automata (HIOAs) to model agent systems and their implicit communication through perturbation of the environment, like localization of objects or radio signals diffusion and detection. The new object,…

Formal Languages and Automata Theory · Computer Science 2013-08-27 Marta Capiluppi , Roberto Segala

We propose an extension of Hybrid I/O Automata (HIOAs) to model agent systems and their implicit communication through perturbation of the environment, like localization of objects or radio signals diffusion and detection. To this end we…

Formal Languages and Automata Theory · Computer Science 2012-10-10 Marta Capiluppi , Roberto Segala

In a previous work, we introduced an input/output variant of stochastic automata (IOSA) that, once the model is closed (i.e., all synchronizations are resolved), the resulting automaton is fully stochastic, that is, it does not contain…

Logic in Computer Science · Computer Science 2018-08-21 Pedro R. D'Argenio , Raúl E. Monti

In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…

Formal Languages and Automata Theory · Computer Science 2017-03-07 Weijun Zhu

Team Automata is a formalism for interacting component-based systems proposed in 1997, whereby multiple sending and receiving actions from concurrent automata can synchronise. During the past 25+ years, team automata have been studied and…

Logic in Computer Science · Computer Science 2025-09-17 Maurice H. ter Beek , Rolf Hennicker , José Proença

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…

Formal Languages and Automata Theory · Computer Science 2020-02-18 Alejandro Grez , Filip Mazowiecki , Michał Pilipczuk , Gabriele Puppis , Cristian Riveros

Choreography automata are an automata-based model of choreographies, that we show to be a compositional one. Choreography automata represent global views of choreographies (and rely on the well-known model of communicating finite-state…

Formal Languages and Automata Theory · Computer Science 2021-07-15 Franco Barbanera , Ivan Lanese , Emilio Tuosto

I/O conformance testing theories (e.g., ioco) are concerned with formally defining when observable output behaviors of an implementation conform to those permitted by a specification. Thereupon, several real-time extensions of ioco, usually…

Logic in Computer Science · Computer Science 2020-02-18 Lars Luthmann , Hendrik Göttmann , Malte Lochau

Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way. Several open dynamical systems can be…

Dynamical Systems · Mathematics 2016-02-25 David I. Spivak

IoT systems are growing larger and larger and are becoming suitable for basic automation tasks. One of the features IoT automation systems can provide is dealing with a dynamic system -- Devices leaving and joining the system during…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-12 Jan Seeger , Rohit A. Deshmukh , Arne Bröring

This paper presents an approach to dynamic component composition that facilitates creating new composed components using existing ones at runtime and without any code generation. The dynamic abilities are supported by extended type notion…

Software Engineering · Computer Science 2014-09-03 Efim Grinkrug

Classical approaches like process algebras or labelled transition systems deal with static composition to model non-trivial concurrent or distributed systems; this is not sufficient for systems with dynamic architecture and with variable…

Software Engineering · Computer Science 2011-12-30 Christian Attiogbé

We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…

Formal Languages and Automata Theory · Computer Science 2021-04-19 Tomoyuki Yamakami

To model real-world software systems, modelling paradigms should support a form of compositionality. In interface theory and model-based testing with inputs and outputs, conjunctive operators have been introduced: the behaviour allowed by…

Formal Languages and Automata Theory · Computer Science 2020-02-21 Ramon Janssen

The integration of Artificial Intelligence (AI) into automation systems has the potential to enhance efficiency and to address currently unsolved existing technical challenges. However, the industry-wide adoption of AI is hindered by the…

Systems and Control · Electrical Eng. & Systems 2024-07-04 Marvin Schieseck , Philip Topalis , Lasse Reinpold , Felix Gehlhoff , Alexander Fay

We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic…

Formal Languages and Automata Theory · Computer Science 2024-01-09 Ezio Bartocci , Thomas A. Henzinger , Dejan Nickovic , Ana Oliveira da Costa

In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…

Cellular Automata and Lattice Gases · Physics 2007-07-06 Xu Xu , Yi Song , Stephen P. Banks

Synchronous coordination systems allow the exchange of data by logically indivisible actions involving all coordinated entities. This paper introduces behavioural automata, a logically synchronous coordination model based on the Reo…

Formal Languages and Automata Theory · Computer Science 2011-08-02 José Proença , Dave Clarke , Erik de Vink , Farhad Arbab

The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a larger system that exhibits their collective behavior in a meaningful way. We propose an automaton-based paradigm for…

Logic in Computer Science · Computer Science 2023-02-03 Tobias Kappé , Farhad Arbab , Carolyn Talcott

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
‹ Prev 1 2 3 10 Next ›