TY - GEN
T1 - Domains of higher-dimensional automata
AU - Goubanlt, Eric
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993/1/1
Y1 - 1993/1/1
N2 - We carry on the program set up in [GJ92] by giving constructions of “domains of higher-dimensional automata (HDA)” on which we can define the truly-concurrent semantics of parallel languages, much in the style of domain theory (see [GS90]). In [GJ92] we gave a semantics for CCS-like languages. In this article, we show how to extend the technique to languages with real states, while keeping nice algebraic definitions. In particular, we are still able to compute local invariants which can decide a few computational properties of interest. For being used as actual computational definitions, the semantics is denotational (i.e. compositional); for being precise enough when it comes to studying the dynamic behaviour of programs, the denotations are higher-dimensional automata, which are no more than an operational behaviour (in the style of operational semantics, see [Plo81]). We conclude by giving the semantics of a small shared-memory imperative language.
AB - We carry on the program set up in [GJ92] by giving constructions of “domains of higher-dimensional automata (HDA)” on which we can define the truly-concurrent semantics of parallel languages, much in the style of domain theory (see [GS90]). In [GJ92] we gave a semantics for CCS-like languages. In this article, we show how to extend the technique to languages with real states, while keeping nice algebraic definitions. In particular, we are still able to compute local invariants which can decide a few computational properties of interest. For being used as actual computational definitions, the semantics is denotational (i.e. compositional); for being precise enough when it comes to studying the dynamic behaviour of programs, the denotations are higher-dimensional automata, which are no more than an operational behaviour (in the style of operational semantics, see [Plo81]). We conclude by giving the semantics of a small shared-memory imperative language.
UR - https://www.scopus.com/pages/publications/85022976561
U2 - 10.1007/3-540-57208-2_21
DO - 10.1007/3-540-57208-2_21
M3 - Conference contribution
AN - SCOPUS:85022976561
SN - 9783540572084
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 293
EP - 307
BT - CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings
A2 - Best, Eike
PB - Springer Verlag
T2 - 4th International Conference on Concurrency Theory, CONCUR 1993
Y2 - 23 August 1993 through 26 August 1993
ER -