Complete calculi for structured specifications in fork algebra

Mostrar todas las versiones(2)

In previous articles we presented Arg entum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Arg entum's foundations were formalized in the framework of institutions. The formalization made simple to describe a methodology capable of producing a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	López Pombo, Carlos Gustavo, Frias, Marcelo
Publicado:	2010
Materias:	Complete system Logical language Partial views Structured specification Transitive closure Biomineralization Calculations Specifications Algebra
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v6255LNCS_n_p290_LopezPombo http://hdl.handle.net/20.500.12110/paper_03029743_v6255LNCS_n_p290_LopezPombo
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_03029743_v6255LNCS_n_p290_LopezPombo
record_format	dspace
spelling	paper:paper_03029743_v6255LNCS_n_p290_LopezPombo2023-06-08T15:28:36Z Complete calculi for structured specifications in fork algebra López Pombo, Carlos Gustavo Frias, Marcelo Complete system Logical language Partial views Structured specification Transitive closure Biomineralization Calculations Specifications Algebra In previous articles we presented Arg entum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Arg entum's foundations were formalized in the framework of institutions. The formalization made simple to describe a methodology capable of producing a complete system desription from partial views, eventually written in different logical languages. Structured specifications were introduced by Sannella and Tarlecki and extensively studied by Borzyszkowski. The latter also presented conditions under which the calculus for structured specifications is complete. Using fork algebras as a "universal" institution capable of representing expressive logics (such as dynamic and temporal logics), requires using a fork language that includes a reflexive-transitive closure operator. The calculus thus obtained does not meet the conditions required by Borzyszkowski. In this article we present structure building operators (SBOs) over fork algebras, and provide a complete calculus for these operators. © 2010 Springer-Verlag. Fil:Lopez Pombo, C.G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Frias, M.F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2010 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v6255LNCS_n_p290_LopezPombo http://hdl.handle.net/20.500.12110/paper_03029743_v6255LNCS_n_p290_LopezPombo
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Complete system Logical language Partial views Structured specification Transitive closure Biomineralization Calculations Specifications Algebra
spellingShingle	Complete system Logical language Partial views Structured specification Transitive closure Biomineralization Calculations Specifications Algebra López Pombo, Carlos Gustavo Frias, Marcelo Complete calculi for structured specifications in fork algebra
topic_facet	Complete system Logical language Partial views Structured specification Transitive closure Biomineralization Calculations Specifications Algebra
description	In previous articles we presented Arg entum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Arg entum's foundations were formalized in the framework of institutions. The formalization made simple to describe a methodology capable of producing a complete system desription from partial views, eventually written in different logical languages. Structured specifications were introduced by Sannella and Tarlecki and extensively studied by Borzyszkowski. The latter also presented conditions under which the calculus for structured specifications is complete. Using fork algebras as a "universal" institution capable of representing expressive logics (such as dynamic and temporal logics), requires using a fork language that includes a reflexive-transitive closure operator. The calculus thus obtained does not meet the conditions required by Borzyszkowski. In this article we present structure building operators (SBOs) over fork algebras, and provide a complete calculus for these operators. © 2010 Springer-Verlag.
author	López Pombo, Carlos Gustavo Frias, Marcelo
author_facet	López Pombo, Carlos Gustavo Frias, Marcelo
author_sort	López Pombo, Carlos Gustavo
title	Complete calculi for structured specifications in fork algebra
title_short	Complete calculi for structured specifications in fork algebra
title_full	Complete calculi for structured specifications in fork algebra
title_fullStr	Complete calculi for structured specifications in fork algebra
title_full_unstemmed	Complete calculi for structured specifications in fork algebra
title_sort	complete calculi for structured specifications in fork algebra
publishDate	2010
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v6255LNCS_n_p290_LopezPombo http://hdl.handle.net/20.500.12110/paper_03029743_v6255LNCS_n_p290_LopezPombo
work_keys_str_mv	AT lopezpombocarlosgustavo completecalculiforstructuredspecificationsinforkalgebra AT friasmarcelo completecalculiforstructuredspecificationsinforkalgebra
_version_	1768546541008584704

Complete calculi for structured specifications in fork algebra

Ejemplares similares