Factorization for Component-Interaction Automata

Investor logo
Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BENEŠ Nikola ČERNÁ Ivana ŠTEFAŇÁK Filip

Year of publication 2012
Type Article in Proceedings
Conference SOFSEM 2012: Theory and Practice of Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-642-27660-6_45
Field Informatics
Keywords factorization; component-interaction automata; synthesis; quotient
Attached files
Description 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).
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info