Results 1 
5 of
5
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...
Fischer's Protocol in Timed Process Algebra
, 1994
"... Timed algebraic process theories can be developed with quite different purposes in mind. One can aim for theoretical results about the theory itself (completeness, expressiveness, decidability), or one can aim for practical applicability to nontrivial protocols. Unfortunately, these aims do not go ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Timed algebraic process theories can be developed with quite different purposes in mind. One can aim for theoretical results about the theory itself (completeness, expressiveness, decidability), or one can aim for practical applicability to nontrivial protocols. Unfortunately, these aims do not go well together. In this paper we take two theories, which are probably of the first kind, and try to find out how well suited they are for practical verifications. We verify Fischer's protocol for mutual exclusion in the settings of discretetime process algebra (ACP dt ) and realtime process algebra (ACP ur ). We do this by transforming the recursive specification into an equivalent linear specification, and then dividing out the maximal bisimulation relation. The required mutual exclusion result can then be found by reasoning about the obtained process graph. Finally, we consider the ease of the verification, and ways to adapt the theory to make it more practical. It will turn out that the...
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...
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
(Show Context)
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
(Show Context)
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