Results 1  10
of
10
Algebra of Timed Frames
, 1996
"... Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its connection with discrete time process algebra are given. The presented theory of timed frames captures the ba ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its connection with discrete time process algebra are given. The presented theory of timed frames captures the basic algebraic properties of timed transition systems for the relative time case. Further structure on timed frames is provided by adding signal inserted states and conditional transitions, thus giving a semantic basis for discrete time process algebra with propositional signals. Time conditions are introduced to cover the absolute time case. Keywords & Phrases: discrete time, frame algebra, process algebra, conditional transitions, signal inserted states, timed frames, oebisimulation. 1994 CR Categories: F.1.1, F.3.1, F.3.2, D.1.3, D.3.1. Contents 1 Introduction 1 2 Preliminaries 2 2.1 Simple frames : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2.2 Signal inserted frames...
Truth of Duration Calculus Formulae in Timed Frames
 Fundamenta Informaticae
, 1996
"... The truth of duration calculus formulae in timed frames is studied. This issue is relevant to the problem of verifying whether the implementation of a software system obeys certain realtime requirements expressed for it. Two approaches are presented and related: (1) extracting interpretations of st ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
The truth of duration calculus formulae in timed frames is studied. This issue is relevant to the problem of verifying whether the implementation of a software system obeys certain realtime requirements expressed for it. Two approaches are presented and related: (1) extracting interpretations of state variables from paths in frames, and (2) relating duration calculus formulae directly to paths in frames. The embedding of duration calculus into a classical firstorder logic for timed frames is considered as well. Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University, the Netherlands, where he is a Senior Computer Scientist and a Professor of Applied Logic, respectively. His research interest is in formal techniques for the development of software for reactive and distributed systems, including related subjects such as semantics of specification languages and concurrency theory. Email: cam@iist.unu.edu...
Models for Feature Descriptions and Interactions
, 1997
"... The problem of feature interactions in telephone  and other software systems ([13]) has been identified as being of great importance, but its solution remains elusive. In recent years, amongst others, several formal approaches have been tried, but the use of formal methods has met with limitati ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The problem of feature interactions in telephone  and other software systems ([13]) has been identified as being of great importance, but its solution remains elusive. In recent years, amongst others, several formal approaches have been tried, but the use of formal methods has met with limitations and even criticism. This criticism is discussed in more detail, and two modelling approaches, viz. Interworkings and Timed Frames are proposed that (partially) meet the objections. The models are illustrated with examples. The paper concludes with directions for future work. 1 Introduction The problem of feature interactions in telephone  and other software systems ([13]) has been identified as being of great importance, but as of yet it seems further away from a solution than ever. In recent years, among others, several formal approaches have been tried (cf. [7, 9, 11, 12, 5, 4, 18, 14]), but recently there has been some disenchantment with the use of formal methods to tackle the...
FrameBased Process Logics
 In
, 1995
"... This paper will be published in: Modal Logic and Process algebra, Alban Ponse, Yde Venema and Maarten de Rijke (eds.), CSLI publications, to appear. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
This paper will be published in: Modal Logic and Process algebra, Alban Ponse, Yde Venema and Maarten de Rijke (eds.), CSLI publications, to appear.
A Logic for Signal Inserted Timed Frames
, 1996
"... We propose a firstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity; it can distinguish frames that are not the same as sets of transitions and states. We show how Dicky logic and CTL can be embedded into TFL. 1 Introductio ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We propose a firstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity; it can distinguish frames that are not the same as sets of transitions and states. We show how Dicky logic and CTL can be embedded into TFL. 1 Introduction In recent years, a multitude of process algebras have evolved. Bergstra and Ponse [9, 10] proposed to study basic properties of such process algebras on the level of frames, which are labelled, directed graphs. Essentially, frames are transition systems without explicit start and termination nodes. Frames can be converted into processes by means of process extraction, which means that two states are singled out, which represent the start state and the successful termination state respectively. Thus, the algebra of frames constitutes a common platform for the study of basic properties of process algebras. Most process algebras have been extended with special features, in order to enhance t...
Timed Frame Models for Discrete Time Process Algebras
, 1997
"... A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Jan Bergstra is a Professor of Programming and So ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Jan Bergstra is a Professor of Programming and Software Engineering at the University of Amsterdam and a Professor of Applied Logic at Utrecht University, both in the Netherlands. His research interest is in mathematical aspects of software and system development, in particular in the design of algebras that can contribute to a better understanding of the relevant issues at a conceptual level. He is perhaps best known for his contributions to the field of process algebra. Email: janb@fwi.uva.nl Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University, the Netherlands, where he is a Senior Computer Scientist and a Professor of Applied Logic, respectively. His ...
C.A.: Data linkage algebra, data linkage dynamics, and priority rewriting
, 2008
"... Abstract. We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation in which states of computations are modelled as data linkages and state changes take place b ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation in which states of computations are modelled as data linkages and state changes take place by means of certain actions. We describe the state changes and replies that result from performing those actions by means of a term rewriting system with rule priorities. The model in question is an upgrade of molecular dynamics. The upgrading is mainly concerned with the features to deal with values and the features to reclaim garbage.
Timed Frame Models for Discrete Time Process Algebras
, 1997
"... A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Keywords & Phrases: discrete time, frame algebra, ..."
Abstract
 Add to MetaCart
A model for discrete time process algebra with relative timing is given by defining an interpretation of the constants and operators on timed frames. It is shown that the model which is obtained is isomorphic with a graph model for the same algebra. Keywords & Phrases: discrete time, frame algebra, process algebra, relative timing, timed frames. Jan Bergstra is a Professor of Programming and Software Engineering at the University of Amsterdam and a Professor of Applied Logic at Utrecht University, both in the Netherlands. His research interest is in mathematical aspects of software and system development, in particular in the design of algebras that can contribute to a better understanding of the relevant issues at a conceptual level. He is perhaps best known for his contributions to the field of process algebra. Email: janb@fwi.uva.nl Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University, the Netherl...
A Logic for Signal Inserted Timed Frames
"... We propose a rstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity� it can distinguish frames that are not the same as sets of transitions and states. We showhowDicky logic and CTL can be embedded in TFL. 1 ..."
Abstract
 Add to MetaCart
We propose a rstorder predicate logic TFL of timed frames extended with signals. This logic combines a simple syntax with a high expressivity� it can distinguish frames that are not the same as sets of transitions and states. We showhowDicky logic and CTL can be embedded in TFL. 1
Algebra of Timed Frames J.A. Bergstra 1�2
"... Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its connection with discrete time process algebra are given. The presented theory of timed frames captures the ba ..."
Abstract
 Add to MetaCart
Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its connection with discrete time process algebra are given. The presented theory of timed frames captures the basic algebraic properties of timed transition systems for the relative time case. Further structure on timed frames is provided by adding signal inserted states and conditional transitions, thus giving a semantic basis for discrete time process algebra with propositional signals. Time conditions