DMCA
A Logic for Signal Inserted Timed Frames (1996)
| Citations: | 4 - 4 self |
BibTeX
@MISC{Bergstra96alogic,
author = {Jan Bergstra and Wan Fokkink and Kees Middelburg},
title = {A Logic for Signal Inserted Timed Frames},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a first-order 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...
Keyphrases
process algebra signal inserted timed frame basic property high expressivity first-order predicate logic tfl recent year common platform process extraction dicky logic explicit start transition system start state timed frame termination node special feature simple syntax successful termination state
