Results 1 
8 of
8
On the Foundations of Final Semantics: NonStandard Sets, Metric Spaces, Partial Orders
 PROCEEDINGS OF THE REX WORKSHOP ON SEMANTICS: FOUNDATIONS AND APPLICATIONS, VOLUME 666 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... Canonical solutions of domain equations are shown to be final coalgebras, not only in a category of nonstandard sets (as already known), but also in categories of metric spaces and partial orders. Coalgebras are simple categorical structures generalizing the notion of postfixed point. They are ..."
Abstract

Cited by 48 (10 self)
 Add to MetaCart
Canonical solutions of domain equations are shown to be final coalgebras, not only in a category of nonstandard sets (as already known), but also in categories of metric spaces and partial orders. Coalgebras are simple categorical structures generalizing the notion of postfixed point. They are also used here for giving a new comprehensive presentation of the (still) nonstandard theory of nonwellfounded sets (as nonstandard sets are usually called). This paper is meant to provide a basis to a more general project aiming at a full exploitation of the finality of the domains in the semantics of programming languages  concurrent ones among them. Such a final semantics enjoys uniformity and generality. For instance, semantic observational equivalences like bisimulation can be derived as instances of a single `coalgebraic' definition (introduced elsewhere), which is parametric of the functor appearing in the domain equation. Some properties of this general form of equivalence are also studied in this paper.
Axiomatizing GSOS with Termination
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."
A Paradigm for Asynchronous Communication and its Application to Concurrent Constraint Programming
 Logic programming languages: constraints, functions, and objects, Logic Programming Series
, 1993
"... We develop a general semantic theory of asynchronous communication in concurrent logic and concurrent constraint languages. The main characteristic of these languages, from the point of view of the communication mechanism, is that processes interact by querying and updating some common data structur ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
We develop a general semantic theory of asynchronous communication in concurrent logic and concurrent constraint languages. The main characteristic of these languages, from the point of view of the communication mechanism, is that processes interact by querying and updating some common data structure. We abstract from the specific features of the underlying data structure by means of a uniform language of which the actions are interpreted as transformations on an abstract set of states. This approach shows that there exists a basic similarity between concurrent logic (constraint) languages and other languages based on asynchrononous communication, like dataflow and asynchronous CSP. Actually, our intention is to capture languages based on asynchronous communication as instances of this uniform language, such an instance being determined by a specific set of states and interpretation of the actions. The computational model of our paradigm is described by a transition system in the style...
Transition System Specifications in Stalk Format With Bisimulation as a Congruence
 in Proceedings 11th Symposium on Theoretical Aspects of Computer Science
, 1994
"... A manysorted variant, called stalk format, of the single sorted tyftformat for transition system specifications, introduced by Groote and Vaandrager, is proposed. The stalk format is shown to be a convenient formalism to express continuationstyle transition systems for languages incorporating con ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
A manysorted variant, called stalk format, of the single sorted tyftformat for transition system specifications, introduced by Groote and Vaandrager, is proposed. The stalk format is shown to be a convenient formalism to express continuationstyle transition systems for languages incorporating concepts as, e.g., process creation or backtracking, for which the existing formats seem less adequate. It is proved, extending a similar result for the single sorted case, that for an appropriate generalization of (strong) bisimilarity for the present manysorted setting, bisimulation with respect to a transition system specification in stalk format, is a congruence. It is argued that the several conditions, required for the type of transition system specification put forward in the paper, can not be relaxed without loosing this congruence. Finally, the present format is compared with several existing ones in the literature, viz. De Simone, GSOS and pure tyftformat. Keywords and phrases se...
Operational Semantics
"... Reproduction of all or part of this workis permitted for educational or research use on condition that this copyright notice isincluded in any copy. ..."
Abstract
 Add to MetaCart
(Show Context)
Reproduction of all or part of this workis permitted for educational or research use on condition that this copyright notice isincluded in any copy.
Axiomatizing GSOS with termination
"... We discuss a combination of GSOStype structural operational semantics with explicit termination, that we call the taghformat (tagh being short for termination and GSOS hybrid). The taghformat distinguishes between transition and termination rules, but, besides active and negative premises as in G ..."
Abstract
 Add to MetaCart
We discuss a combination of GSOStype structural operational semantics with explicit termination, that we call the taghformat (tagh being short for termination and GSOS hybrid). The taghformat distinguishes between transition and termination rules, but, besides active and negative premises as in GSOS, also allows for what we call terminating and passive arguments. We extend the result of Aceto, Bloom and Vaandrager on the automatic generation of sound and complete axiomatizations for GSOS to the setting of taghtransition systems. The construction of the equational theory is based upon the notion of a smooth and distinctive operation, which have been generalized from GSOS to tagh. We prove the soundness of the synthesized laws and show their completeness modulo bisimulation. The examples provided indicate a significant, though yet not ideal, improvement over the axiomatization techniques known so far. Key words: Structured operational semantics, GSOS format, equational theories, bisimulation equivalence, complete axiomatizations, approximation induction principle 1
A Complete Ordertheoretic Model for the Algebra of Communicating Processes
, 1994
"... In this paper an ordertheoretic denotational semantics for a small programming language is defined. The main result is that this denotational semantics is a sound and complete model for the equational theory of the language. As an immediate corollary we obtain that two process terms are bisimul ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper an ordertheoretic denotational semantics for a small programming language is defined. The main result is that this denotational semantics is a sound and complete model for the equational theory of the language. As an immediate corollary we obtain that two process terms are bisimular if and only if they are denotationally equal. 1 Introduction Much research in the study of the semantics of concurrent programming language focusses on socalled uniform languages. These languages are defined by a collection of elementary programs or atomic actions, and a number of program constructors like sequential composition `;' and choice `+'. The languages are called `uniform' since these atomic actions are not further specified. The operational meaning of such programs is usually given by menas of a transition system which formalizes the elementary steps the program can take. A transition system is usually specified by means of a Structured Operational Semantics (SOS) system, in...
The Semantics of the Combination of Atomized Statements and Parallel Choice
, 1998
"... . In this paper we define a uniform language L that is an extension of the language underlying the process algebra PA. One of the main extensions of this language over PA is given by socalled atomizing brackets. If we place these brackets around a statement then we treat this statement as an atomic ..."
Abstract
 Add to MetaCart
. In this paper we define a uniform language L that is an extension of the language underlying the process algebra PA. One of the main extensions of this language over PA is given by socalled atomizing brackets. If we place these brackets around a statement then we treat this statement as an atomic action. Put differently, these brackets remove all interleaving points. We present a transition system for the language and derive its operational semantics. We show that there are several options for defining a transition system such that the resulting operational semantics is a conservative extension of the semantics for PA. We define a semantic domain and a denotational model for the language. Next we define a closure operator on the semantic domain and show how to use this closure operator to derive a fully abstract denotational semantics. Then the algebraic theory of the language is considered. We define a collection of axioms and a term rewrite system based on these axioms. Using this...