Computations and Interaction

Baeten, J.C.M.; Luttik, Bas; Tilburg, Paul van

doi:10.1007/978-3-642-19056-8_3

Cited by 3 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is to recognise that a finite automaton is just a special type of labelled transition system, that more complicate automata (pushdown automata, Turing machines) naturally generate transition systems, and that there is a natural correspondence between regular expressions and grammars on the one hand and certain process calculi on the other hand. In [7,9,10] we have studied the various notions of automata from AFT modulo branching bisimilarity. In [8] we have explored the correspondence between finite automata and regular expressions extended with parallel composition modulo strong bisimilarity.…”

Section: Introductionmentioning

confidence: 99%

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)

Baeten

Luttik

Yang

2017

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

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 pushdown processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operational semantics for the sequential composition operator in the context of intermediate termination.With the revised operational semantics, we eliminate transparency, allowing us to establish a close correspondence between context-free processes and pushdown processes. Moreover, we prove the reactive Turing powerfulness of TCP with iteration and nesting with the revised operational semantics for sequential composition.

show abstract