Revisiting compatibility of input-output modal transition systems

Modern software systems are typically built of components that communicate through their external interfaces. The external behavior of a component can be effectively described using finite state automata-based formalisms. Such component models can then used for varied analyses. For example, interfac...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2014
Materias:
Interface states
Automata-based formalisms
Component implementations
External behavior
Interface automata
Modal Transition Systems
Modeling formalisms
Requirements specifications
Software systems
Automata theory
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8442LNCS_n_p367_Krka
http://hdl.handle.net/20.500.12110/paper_03029743_v8442LNCS_n_p367_Krka
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_03029743_v8442LNCS_n_p367_Krka
record_format dspace
spelling paper:paper_03029743_v8442LNCS_n_p367_Krka2023-06-08T15:28:53Z Revisiting compatibility of input-output modal transition systems Interface states Automata-based formalisms Component implementations External behavior Interface automata Modal Transition Systems Modeling formalisms Requirements specifications Software systems Automata theory Modern software systems are typically built of components that communicate through their external interfaces. The external behavior of a component can be effectively described using finite state automata-based formalisms. Such component models can then used for varied analyses. For example, interface automata, which model the behavior of components in terms of component states and transitions between them, can be used to check whether the resulting system is compatible. By contrast, partial-behavior modeling formalisms, such as modal transition systems, can be used to capture and then verify properties of sets of prospective component implementations that satisfy an incomplete requirements specification. In this paper, we study how pairwise compatibility should be defined for partial-behavior models. To this end, we describe the limitations of the existing compatibility definitions, propose a set of novel compatibility notions for modal interface automata, and propose efficient, correct, and complete compatibility checking procedures © 2014 Springer International Publishing Switzerland. 2014 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8442LNCS_n_p367_Krka http://hdl.handle.net/20.500.12110/paper_03029743_v8442LNCS_n_p367_Krka
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Interface states
Automata-based formalisms
Component implementations
External behavior
Interface automata
Modal Transition Systems
Modeling formalisms
Requirements specifications
Software systems
Automata theory
spellingShingle Interface states
Automata-based formalisms
Component implementations
External behavior
Interface automata
Modal Transition Systems
Modeling formalisms
Requirements specifications
Software systems
Automata theory
Revisiting compatibility of input-output modal transition systems
topic_facet Interface states
Automata-based formalisms
Component implementations
External behavior
Interface automata
Modal Transition Systems
Modeling formalisms
Requirements specifications
Software systems
Automata theory
description Modern software systems are typically built of components that communicate through their external interfaces. The external behavior of a component can be effectively described using finite state automata-based formalisms. Such component models can then used for varied analyses. For example, interface automata, which model the behavior of components in terms of component states and transitions between them, can be used to check whether the resulting system is compatible. By contrast, partial-behavior modeling formalisms, such as modal transition systems, can be used to capture and then verify properties of sets of prospective component implementations that satisfy an incomplete requirements specification. In this paper, we study how pairwise compatibility should be defined for partial-behavior models. To this end, we describe the limitations of the existing compatibility definitions, propose a set of novel compatibility notions for modal interface automata, and propose efficient, correct, and complete compatibility checking procedures © 2014 Springer International Publishing Switzerland.
title Revisiting compatibility of input-output modal transition systems
title_short Revisiting compatibility of input-output modal transition systems
title_full Revisiting compatibility of input-output modal transition systems
title_fullStr Revisiting compatibility of input-output modal transition systems
title_full_unstemmed Revisiting compatibility of input-output modal transition systems
title_sort revisiting compatibility of input-output modal transition systems
publishDate 2014
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8442LNCS_n_p367_Krka
http://hdl.handle.net/20.500.12110/paper_03029743_v8442LNCS_n_p367_Krka
_version_ 1768545328213000192

Ejemplares similares