Delayed choice for process algebra with abstraction

TitleDelayed choice for process algebra with abstraction
Publication TypeConference Paper
Year of Publication1995
AuthorsD'Argenio, PR, Mauw, S
EditorLee, I, Smolka, SA
Conference NameCONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings
PublisherSpringer
ISBN Number3-540-60218-6
AbstractThe 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.
DOI10.1007/3-540-60218-6_38
PDF (Full text):