Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete,real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms. In this short abstract, we collect results of our work in progress on describing and systematizing the algebraic assumptions in specification theories.
|Titel||Proceeings of FIT 10: 8th International Conference on Frontiers of Information Technology|
|Forlag||Association for Computing Machinery|
|Publikationsdato||25 jan. 2011|
|Status||Udgivet - 25 jan. 2011|