The semantics of a simple language for describing tightly coupled “synchronous” systems is defined. An operational semantics is given by term rewriting rules and a consistent fully abstract denotational semantics is defined based on the concept of observable behavior and advanced fixed point theory. Particular properties of the language are analysed and especially algebraic laws of the language are discussed. Finally some aspects and problems of the formal definition of the semantics of such a language are treated also comparing them to other approaches found in the literature
AbstractOperational and denotational semantic models are designed for languages with process creatio...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
Abstract: This paper investigates the full abstractness problem for a CCS-like language, $\mathrm{C}...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
Operational and denotational semantic models are designed for languages with process creation, and t...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
Algebraic Theory of Processes provides the first general and systematic introduction to the semantic...
We initially establish a fundamental connection between the semantic theories of concurrency and com...
Within the context of an algebraic theory of processes, an equational specification of process coope...
AbstractProcess algebras are standard formalisms for compositionally describing systems by the depen...
AbstractIn this paper we develop semantic models for a class of concurrent logic languages. We give ...
Action semantics is a framework for semantic description of prograrnming languages. In this framewo...
16th International Symposium, TASE 2022, July 8-10 2022, Cluj-Napoca (Roumanie)International audienc...
AbstractWe present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’)....
AbstractOperational and denotational semantic models are designed for languages with process creatio...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
Abstract: This paper investigates the full abstractness problem for a CCS-like language, $\mathrm{C}...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
Operational and denotational semantic models are designed for languages with process creation, and t...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
Algebraic Theory of Processes provides the first general and systematic introduction to the semantic...
We initially establish a fundamental connection between the semantic theories of concurrency and com...
Within the context of an algebraic theory of processes, an equational specification of process coope...
AbstractProcess algebras are standard formalisms for compositionally describing systems by the depen...
AbstractIn this paper we develop semantic models for a class of concurrent logic languages. We give ...
Action semantics is a framework for semantic description of prograrnming languages. In this framewo...
16th International Symposium, TASE 2022, July 8-10 2022, Cluj-Napoca (Roumanie)International audienc...
AbstractWe present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’)....
AbstractOperational and denotational semantic models are designed for languages with process creatio...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
Abstract: This paper investigates the full abstractness problem for a CCS-like language, $\mathrm{C}...