21 citations · 38 across the 9 of their papers we have counts for
8 papers · 1 filter
Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract)
Jos C. M. Baeten, Bas Luttik
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…
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
Jos C. M. Baeten, Cesare Carissimo, Bas Luttik
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 Reac…
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
Jos Baeten, Bas Luttik, Fei Yang
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequen…
Sequential Composition in the Presence of Intermediate Termination
Jos Baeten, Bas Luttik, Fei Yang
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequen…
A Process Algebra for Supervisory Coordination
Jos Baeten, Bert van Beek, Allan van Hulst +1
A supervisory controller controls and coordinates the behavior of different components of a complex machine by observing their discrete behaviour. Supervisory control theory studie…
Reactive Turing Machines
Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
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 transi…