Delayed choice for process algebra with abstraction
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...
Guardado en:
Autores principales: | D'Argenio, Pedro Rubén, Mauw, Sjouke |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Español |
Publicado: |
1995
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/123147 |
Aporte de: |
Ejemplares similares
-
Using logic in the generation of referring expressions
por: Areces, Carlos Eduardo, et al.
Publicado: (2011) -
Using logic in the generation of referring expressions
por: Areces, C., et al. -
Abstract processes in orchestration languages
Publicado: (2009) -
Abstract processes in orchestration languages
por: Buscemi, M.G., et al.
Publicado: (2009) -
Abstract processes in orchestration languages
por: Buscemi, M.G., et al.
Publicado: (2009)