Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1078075,
author = {Beneš, Nikola and Černá, Ivana and Štefaňák, Filip},
address = {Berlin Heidelberg},
booktitle = {SOFSEM 2012: Theory and Practice of Computer Science},
doi = {http://dx.doi.org/10.1007/978-3-642-27660-6_45},
keywords = {factorization; component-interaction automata; synthesis; quotient},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin Heidelberg},
isbn = {978-3-642-27659-0},
pages = {554-565},
publisher = {Springer Berlin Heidelberg},
title = {Factorization for Component-Interaction Automata},
year = {2012}
}
TY - JOUR
ID - 1078075
AU - Beneš, Nikola - Černá, Ivana - Štefaňák, Filip
PY - 2012
TI - Factorization for Component-Interaction Automata
PB - Springer Berlin Heidelberg
CY - Berlin Heidelberg
SN - 9783642276590
KW - factorization
KW - component-interaction automata
KW - synthesis
KW - quotient
N2 - Component-interaction automata is a verification oriented formalism devised to be general enough to capture important aspects of component interaction in various kinds of component systems. A factorization problem naturally arises in formalisms that are based on composition. In general, the factorization problem may be presented as finding a solution X to the equation M | X = S, where | is a composition and = a behavioural equivalence. In our framework, the equivalence is the weak bisimulation and composition is parametrized. We provide a solution for the factorization problem which is built on top of the approach of Qin and Lewis (CONCUR 1990).
ER -
BENEŠ, Nikola, Ivana ČERNÁ a Filip ŠTEFAŇÁK. Factorization for Component-Interaction Automata. In \textit{SOFSEM 2012: Theory and Practice of Computer Science}. Berlin Heidelberg: Springer Berlin Heidelberg, 2012, s.~554-565. ISBN~978-3-642-27659-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-27660-6\_{}45.
|
