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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	D'Argenio, Pedro Rubén, Mauw, Sjouke
Formato:	Objeto de conferencia
Lenguaje:	Español
Publicado:	1995
Materias:	Matemática Algebra Process calculus Structure (mathematical logic) Branching (linguistics) Conservative extension Time complexity Mathematics Abstraction (linguistics) Operator (computer programming) Process (computing)
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/123147
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-123147
record_format	dspace
institution	Universidad Nacional de La Plata
institution_str	I-19
repository_str	R-120
collection	SEDICI (UNLP)
language	Español
topic	Matemática Algebra Process calculus Structure (mathematical logic) Branching (linguistics) Conservative extension Time complexity Mathematics Abstraction (linguistics) Operator (computer programming) Process (computing)
spellingShingle	Matemática Algebra Process calculus Structure (mathematical logic) Branching (linguistics) Conservative extension Time complexity Mathematics Abstraction (linguistics) Operator (computer programming) Process (computing) D'Argenio, Pedro Rubén Mauw, Sjouke Delayed choice for process algebra with abstraction
topic_facet	Matemática Algebra Process calculus Structure (mathematical logic) Branching (linguistics) Conservative extension Time complexity Mathematics Abstraction (linguistics) Operator (computer programming) Process (computing)
description	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.
format	Objeto de conferencia Objeto de conferencia
author	D'Argenio, Pedro Rubén Mauw, Sjouke
author_facet	D'Argenio, Pedro Rubén Mauw, Sjouke
author_sort	D'Argenio, Pedro Rubén
title	Delayed choice for process algebra with abstraction
title_short	Delayed choice for process algebra with abstraction
title_full	Delayed choice for process algebra with abstraction
title_fullStr	Delayed choice for process algebra with abstraction
title_full_unstemmed	Delayed choice for process algebra with abstraction
title_sort	delayed choice for process algebra with abstraction
publishDate	1995
url	http://sedici.unlp.edu.ar/handle/10915/123147
work_keys_str_mv	AT dargeniopedroruben delayedchoiceforprocessalgebrawithabstraction AT mauwsjouke delayedchoiceforprocessalgebrawithabstraction
bdutipo_str	Repositorios
_version_	1764820449825390592

Delayed choice for process algebra with abstraction

Ejemplares similares