Suchergebnisse - "Computer Science - Formal Languages and Automata Theory"

The Big-O Problem von Chistikov, Dmitry, Kiefer, Stefan, Murawski, Andrzej S., Purser, David

“… Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater …”
Volltext

Degrees of Lookahead in Regular Infinite Games von Holtmann, Michael, Kaiser, Lukasz, Thomas, Wolfgang

“… We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications …”
Volltext

A Concurrent Pattern Calculus von Given-Wilson, Thomas, Gorla, Daniele, Jay, Barry

“… The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns …”
Volltext

The Big-O Problem von Chistikov, Dmitry, Kiefer, Stefan, Murawski, Andrzej S, Purser, David

“… Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater …”
Volltext

Timed automata as a formalism for expressing security: A survey on theory and practice von Arcile, Johan, Étienne André

“… Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints …”
Volltext

An Efficient Summation Algorithm for the Accuracy, Convergence and Reproducibility of Parallel Numerical Methods von Benmouhoub, Farah, Pierre-Loïc Garoche, Martel, Matthieu

“… This sum is subject to many numerical errors in floating-point arithmetic. To alleviate this issue, we have introduced a new parallel algorithm for summing a sequence of floating-point numbers …”
Volltext

Joint State Estimation Under Attack of Discrete Event Systems von Zhang, Qi, Seatzu, Carla, Li, Zhiwu, Giua, Alessandro

“… The problem of state estimation in the setting of partially-observed discrete event systems subject to cyber attacks is considered …”
Volltext

Experience Report: Towards Moving Things with Types -- Helping Logistics Domain Experts to Control Cyber-Physical Systems with Type-Based Synthesis von Bessai, Jan, Roidl, Moritz, Vasileva, Anna

“… One of the ultimate goals of software engineering is to leave virtual spaces and move real things. We take one step toward supporting users with this goal by …”
Volltext

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata von Modanese, Augusto

“… After an apparent hiatus of roughly 30 years, we revisit a seemingly neglected subject in the theory of (one-dimensional) cellular automata …”
Volltext

TILT: A GDPR-Aligned Transparency Information Language and Toolkit for Practical Privacy Engineering von Grünewald, Elias, Pallas, Frank

“… In this paper, we present TILT, a transparency information language and toolkit explicitly designed to represent and process transparency information in line …”
Volltext

Proceedings Tenth International Workshop on Graph Computation Models von Echahed, Rachid, Plump, Detlef

“… This volume contains the post-proceedings of the Tenth International Workshop on Graph Computation Models (GCM 2019: http://gcm2019.imag.fr). The workshop was …”
Volltext

Control Improvisation von Fremont, Daniel J, Donzé, Alexandre, Seshia, Sanjit A, Wessel, David

“… Given an automaton, the problem is to produce an improviser, a probabilistic algorithm that randomly generates words in its language, subject to two additional constraints …”
Volltext

Abelian logic gates von Holroyd, Alexander E, Levine, Lionel, Winkler, Peter

“… (subject only to a halting condition). We prove that any finite abelian processor can be emulated by a network of certain very simple abelian processors, which we call gates …”
Volltext

Dynamic Input/Output Automata: a Formal and Compositional Model for Dynamic Systems von Attie, Paul C, Lynch, Nancy A

“… We also show that parallel composition, action hiding, action renaming, and (subject to some technical conditions …”
Volltext

Degrees of Lookahead in Regular Infinite Games von Holtmann, Michael, Kaiser, Lukasz, Thomas, Wolfgang

“… We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications …”
Volltext

A Concurrent Pattern Calculus von Given-Wilson, Thomas, Gorla, Daniele, Barry, Jay

“… The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns …”
Volltext