Closure properties for the class of behavioral models

Detalhes bibliográficos
Autor(a) principal: Martins, Manuel A.
Data de Publicação: 2007
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10773/5547
Resumo: Hidden k-logics can be considered as the underlying logics of program specification. They constitute natural generalizations of k-deductive systems and encompass deductive systems as well as hidden equational logics and inequational logics. In our abstract algebraic approach, the data structures are sorted algebras endowed with a designated subset of their visible parts, called filter, which represents a set of truth values. We present a hierarchy of classes of hidden k-logics. The hidden k-logics in each class are characterized by three different kinds of conditions, namely, properties of their Leibniz operators, closure properties of the class of their behavioral models, and properties of their equivalence systems. Using equivalence systems, we obtain a new and more complete analysis of the axiomatization of the behavioral models. This is achieved by means of the Leibniz operator and its combinatorial properties. © 2007 Elsevier Ltd. All rights reserved.
id RCAP_1441082f4f992de023d59948246e4ff5
oai_identifier_str oai:ria.ua.pt:10773/5547
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Closure properties for the class of behavioral modelsBehavioral equivalenceBehavioral specificationEquivalential logicHidden equational logicLeibniz operatorAbstractingComputer programmingEquivalence classesBehavioral equivalenceBehavioral specificationEquivalential logicHidden equational logicLeibniz operatorFormal logicHidden k-logics can be considered as the underlying logics of program specification. They constitute natural generalizations of k-deductive systems and encompass deductive systems as well as hidden equational logics and inequational logics. In our abstract algebraic approach, the data structures are sorted algebras endowed with a designated subset of their visible parts, called filter, which represents a set of truth values. We present a hierarchy of classes of hidden k-logics. The hidden k-logics in each class are characterized by three different kinds of conditions, namely, properties of their Leibniz operators, closure properties of the class of their behavioral models, and properties of their equivalence systems. Using equivalence systems, we obtain a new and more complete analysis of the axiomatization of the behavioral models. This is achieved by means of the Leibniz operator and its combinatorial properties. © 2007 Elsevier Ltd. All rights reserved.Elsevier2012-01-27T15:38:50Z2007-01-01T00:00:00Z2007info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/5547eng0304397510.1016/j.tcs.2007.01.024Martins, Manuel A.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:06:27Zoai:ria.ua.pt:10773/5547Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:42:54.680896Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Closure properties for the class of behavioral models
title Closure properties for the class of behavioral models
spellingShingle Closure properties for the class of behavioral models
Martins, Manuel A.
Behavioral equivalence
Behavioral specification
Equivalential logic
Hidden equational logic
Leibniz operator
Abstracting
Computer programming
Equivalence classes
Behavioral equivalence
Behavioral specification
Equivalential logic
Hidden equational logic
Leibniz operator
Formal logic
title_short Closure properties for the class of behavioral models
title_full Closure properties for the class of behavioral models
title_fullStr Closure properties for the class of behavioral models
title_full_unstemmed Closure properties for the class of behavioral models
title_sort Closure properties for the class of behavioral models
author Martins, Manuel A.
author_facet Martins, Manuel A.
author_role author
dc.contributor.author.fl_str_mv Martins, Manuel A.
dc.subject.por.fl_str_mv Behavioral equivalence
Behavioral specification
Equivalential logic
Hidden equational logic
Leibniz operator
Abstracting
Computer programming
Equivalence classes
Behavioral equivalence
Behavioral specification
Equivalential logic
Hidden equational logic
Leibniz operator
Formal logic
topic Behavioral equivalence
Behavioral specification
Equivalential logic
Hidden equational logic
Leibniz operator
Abstracting
Computer programming
Equivalence classes
Behavioral equivalence
Behavioral specification
Equivalential logic
Hidden equational logic
Leibniz operator
Formal logic
description Hidden k-logics can be considered as the underlying logics of program specification. They constitute natural generalizations of k-deductive systems and encompass deductive systems as well as hidden equational logics and inequational logics. In our abstract algebraic approach, the data structures are sorted algebras endowed with a designated subset of their visible parts, called filter, which represents a set of truth values. We present a hierarchy of classes of hidden k-logics. The hidden k-logics in each class are characterized by three different kinds of conditions, namely, properties of their Leibniz operators, closure properties of the class of their behavioral models, and properties of their equivalence systems. Using equivalence systems, we obtain a new and more complete analysis of the axiomatization of the behavioral models. This is achieved by means of the Leibniz operator and its combinatorial properties. © 2007 Elsevier Ltd. All rights reserved.
publishDate 2007
dc.date.none.fl_str_mv 2007-01-01T00:00:00Z
2007
2012-01-27T15:38:50Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/5547
url http://hdl.handle.net/10773/5547
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 03043975
10.1016/j.tcs.2007.01.024
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137477134385152

Registros relacionados