Results 1  10
of
14
Process algebra for hybrid systems
 Theoretical Computer Science
, 2003
"... Abstract. We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
Abstract. We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and
A Logical and Computational Theory of Located Resource
, 2008
"... Experience of practical systems modelling suggests that the key conceptual components of a model of a system are processes, resources, locations, and environment. In recent work, we have given a processtheoretic account of this view in which resources as well as processes are firstclass citizens. ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
Experience of practical systems modelling suggests that the key conceptual components of a model of a system are processes, resources, locations, and environment. In recent work, we have given a processtheoretic account of this view in which resources as well as processes are firstclass citizens. This process calculus, SCRP, captures the structural aspects of the semantics of the Demos2k modelling tool. Demos2k represents environment stochastically using a wide range of probability distributions and queuelike data structures. Associated with SCRP is a (bunched) modal logic, MBI, which combines the usual additive connectives of HennessyMilner logic with their multiplicative counterparts. In this paper, we complete our conceptual framework by adding to SCRP and MBI an account of a notion of location that is simple, yet sufficiently expressive to capture naturally a wide range of forms of location, both spatial and logical. We also provide a description of an extension of the Demos2k tool to incorporate this notion of location. 1
Timeconstrained Reactive Automata  A Novel Development Methodology for Embedded Realtime Systems
, 1991
"... ..."
Control and Data Transfer in the Distributed Editor of the ASF+SDF Metaenvironment
 Group, University of Amsterdam
, 1994
"... For the ASF+SDF Metaenvironment [K93] a new editor that combines text editing and structure editing was designed and implemented [BK93] [Koo94]. The new editor is not a monolithic piece of software, as the previous editor was, but constructed from three interacting components: a userinterface, a t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
For the ASF+SDF Metaenvironment [K93] a new editor that combines text editing and structure editing was designed and implemented [BK93] [Koo94]. The new editor is not a monolithic piece of software, as the previous editor was, but constructed from three interacting components: a userinterface, a text editor and a structure editor. During the implementation of the editor it turned out that the interaction between the user and the editor components and between the editor components themselves was more complex than expected. In this paper an approach is presented to model the interactions between components. Following this approach, a specification of the editor, with emphasis on the most important interactions, is given in PSF [MV89, MV90, M91] and in Synchronous Interworkings [MWW92]. In conclusion, these efforts helped in finding a simple and reliable implementation of the interactions. 1991 Mathematics subject classification: 68Q40, 68Q45. 1991 CR Categories: D.1.3, D.2.1, F.1.2. K...
Equivalence semantics for concurrency: comparison and application
, 1998
"... Since the development of CCS and other process algebras, many extensions to these process algebras have been proposed to model different aspects of concurrent computation. It is important both theoretically and practically to understand the relationships between these process algebras and between ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Since the development of CCS and other process algebras, many extensions to these process algebras have been proposed to model different aspects of concurrent computation. It is important both theoretically and practically to understand the relationships between these process algebras and between the semantic equivalences that are defined for them. In this thesis, I investigate the comparison of semantic equivalences based on bisimulation which are defined for process algebras whose behaviours are described by structured operational semantics, and expressed as labelled transition systems. I first consider a hierarchy of bisimulations for extensions to CCS, using both existing and new results to describe the relationships between their equivalences with respect to pure CCS terms. I then consider a more general approach to comparison by investigating labelled transition systems with structured labels. I define bisimulation homomorphisms between labelled transition systems with different labels, and show how these can be used to compare equivalences. Next, I work in the metatheory of process algebras and consider a new format that is an extension of the tyft/tyxt format for transition system specifications. This format treats labels syntactically instead of schematically, and hence I use a definition of bisimulation which requires equivalence between labels instead of exact matching. I show that standard results such as congruence and conservative extension hold for the new format. I then investigate how comparison of equivalences can be approached through the notion of extension to transition system specifications. This leads to the main results of this study which show how in a very general fashion the bisimulations defined for two different process algebras can be compared over a subset of terms of the process algebras. I also consider what implications the conditions which are required to obtain these results have for modelling process algebras, and show that these conditions do not impose significant limitations. Finally, I show how these results can be applied to existing process algebras. I model a number of process algebras with the extended format and derive new results from the metatheory developed. ii
ITUT Recommendation G.107 : The EModel, a computational model for use in transmission planning
, 2003
"... Abstract. We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known timedependent spatial distribution, such as a protocol transmitting data via a mobile intermediate station. It is a reformulation of the real space process algebra from Baeten and Bergstra [Formal Aspects of Computing 5:481–529, 1993] in a setting with urgent actions. This leads to many simplifications.
Time and Asynchrony in Distributed Computing
, 1996
"... This thesis formulates temporal aspects of distributed systems through developing a new process calculus and its two further expressive extensions. The calculus is defined by extending existing nontimed process calculi. It provides a simple but powerful framework for describing synchronously commun ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This thesis formulates temporal aspects of distributed systems through developing a new process calculus and its two further expressive extensions. The calculus is defined by extending existing nontimed process calculi. It provides a simple but powerful framework for describing synchronously communicating timedependent processes. It has two new constructions for delayed processing and timed restriction, in addition to operational constructors found in many nontimed process calculi: sequential execution, parallel composition, synchronous communication, message scope restriction, and recursion definition. As a verification method, we develop several timesensitive equation theories for processes and study their basic properties. The two extensions reinforce the framework with the ability to express temporal properties of distributed computing. One of the extensions consists of some supplementary language constructors concerning with nonblocking message sending and process locations. ...
An Algebraic Specification of a Manufacturing System with Hierarchical Control
, 1993
"... This paper presents a PSF specification of a fictitious manufacturing system. We also discuss the control of manufacturing systems in general. Finally, an attempt is made to compare the expressive power of PSF and the specification language ProcessTalk. Key Words & Phrases: Specification Langua ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents a PSF specification of a fictitious manufacturing system. We also discuss the control of manufacturing systems in general. Finally, an attempt is made to compare the expressive power of PSF and the specification language ProcessTalk. Key Words & Phrases: Specification Language, PSF, ADT (Abstract Data Types), Process Algebra, Manufacturing System. 1985 Mathematics Subject Classification: 68Q40. 1987 CR Categories: D.1.3, D.2.1, F.1.2. Contents 1 Introduction 2 2 Manufacturing systems 2 2.1 Classification of manufacturing systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.2 Controlling manufacturing systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 The communication protocol : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 3 The specification language PSF 6 3.1 Data in PSF : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ...