This paper investigates the use of a complete metric space framework for providing denotational semantics to a real-time process algebra. The study is carried out in a non-interleaving setting and is based on a timed extension of Langerak's bundle event structures, a variant of Winskel's event structures. The distance function of the metric is based on the amount of time to which event structures do `agree'. We show that this intuitive notion of distance is a pseudo metric (but not a metric) on the set of timed event structures. A generalisation to equivalence classes of timed event structures in which we abstract from event identities and non-executable events (events that can never occur) is shown to be a complete ultra-metric space. We p...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
AbstractThis paper presents a complete axiomatization of two decidable propositional real-time linea...
AbstractThis paper investigates the use of a complete metric space framework for providing denotatio...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
Abstract. We propose a denotational model for real time concurrent systems, based on the failures mo...
AbstractWe investigate the implications of choosing a cpo-framework resp. a complete metric space fr...
In this paper an event-based operational interleaving semantics is proposed for real-time processes,...
Action refinement is an essential operation in the design of concurrent systems, real-time or not. I...
AbstractOur focus is on the semantics of programming and specification languages. Over the years, di...
AbstractWe present a formal framework based on metric temporal logic (MTL) for specifying and verify...
Abstract. The most natural, compositional, way of modeling real-time systems uses a dense domain for...
This thesis presents and studies a timed computational model of parallelism, a Timed Calculus of Com...
Action refinement for real-time concurrent processes with urgent interactions is studied, where a pa...
AbstractWe propose an action refinement approach for real-time concurrent processes with urgent inte...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
AbstractThis paper presents a complete axiomatization of two decidable propositional real-time linea...
AbstractThis paper investigates the use of a complete metric space framework for providing denotatio...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
Abstract. We propose a denotational model for real time concurrent systems, based on the failures mo...
AbstractWe investigate the implications of choosing a cpo-framework resp. a complete metric space fr...
In this paper an event-based operational interleaving semantics is proposed for real-time processes,...
Action refinement is an essential operation in the design of concurrent systems, real-time or not. I...
AbstractOur focus is on the semantics of programming and specification languages. Over the years, di...
AbstractWe present a formal framework based on metric temporal logic (MTL) for specifying and verify...
Abstract. The most natural, compositional, way of modeling real-time systems uses a dense domain for...
This thesis presents and studies a timed computational model of parallelism, a Timed Calculus of Com...
Action refinement for real-time concurrent processes with urgent interactions is studied, where a pa...
AbstractWe propose an action refinement approach for real-time concurrent processes with urgent inte...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
AbstractThis paper presents a complete axiomatization of two decidable propositional real-time linea...