Zobrazeno 1 - 10
of 152
pro vyhledávání: '"Baeten, Jos"'
Autor:
Baeten, Jos C. M., Luttik, Bas
Publikováno v:
EPTCS 387, 2023, pp. 114-131
A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved the pendant of this theorem in a setting with interaction: the set of
Externí odkaz:
http://arxiv.org/abs/2309.07308
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 1 (March 2, 2023) lmcs:9178
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reac
Externí odkaz:
http://arxiv.org/abs/2203.01713
Publikováno v:
EPTCS 255, 2017, pp. 1-17
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and p
Externí odkaz:
http://arxiv.org/abs/1709.02440
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and p
Externí odkaz:
http://arxiv.org/abs/1706.08401
Publikováno v:
EPTCS 60, 2011, pp. 36-55
A supervisory controller controls and coordinates the behavior of different components of a complex machine by observing their discrete behaviour. Supervisory control theory studies automated synthesis of controller models, known as supervisors, base
Externí odkaz:
http://arxiv.org/abs/1108.1863
We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bo
Externí odkaz:
http://arxiv.org/abs/1104.1738
Publikováno v:
Math. Struct. Comp. Sci. 26 (2016) 933-968
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 e
Externí odkaz:
http://arxiv.org/abs/1011.6429
One of the main drawbacks while implementing the interaction between a plant and a supervisor, synthesised by the supervisory control theory of \citeauthor{RW:1987}, is the inexact synchronisation. \citeauthor{balemiphdt} was the first to consider th
Externí odkaz:
http://arxiv.org/abs/0910.0868
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.