Delayed Choice for Process Algebra With Abstraction (1995)
by
Pedro R. D'Argenio
,
Sjouke Mauw
BibTeX
@MISC{D'Argenio95delayedchoice,
author = {Pedro R. D'Argenio and Sjouke Mauw},
title = {Delayed Choice for Process Algebra With Abstraction},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The delayed choice is an operator which serves to combine linear time and branching time within one process algebra. We study this operator in a theory with abstraction, more precisely, in a setting considering branching bisimulation. We show its use in scenario specifications and in verification to reduce irrelevant branching structure of a process.
