基于双代数的进程语义研究-计算机软件与理论专业论文.docxVIP

IIITitle： III Title： Bialgebraic Semantics for Processes Major： Computer Software and Theory Name： Chen Hequn Supervisor Zhou XiaocongI Associate Professor Abstract A bialgebra consists of an algebra-coalgebra pair with a common carrier．It combine the notion of construction and the notion of observation．In computer science，most objects are constructive and have observable behaviors，such as pro- gram，process，automaton，etc．They ca／l be studied through the methods of bialgebra．Bialgebrmc methods were proved to be a effective way to investigate the relationship between static structure and dynamical behavior of state-based systems． The syntax of a programming language is a initial algebral while the semantics of this language is a final coalgebra．A pair of bialgebra can be constructed by given a coalgebra on initial algebra，and a algebra on final coalgebra．If the bialgebra pairs are constructed under the same functor，the properties of initial algebra and final coalgebra call be used to investigate the semantics of program．This way is a new idea in the theory of coalgebra，and has been applied in the studies of operational semantics and denotational semantics for process，automaton，etc． Process Can be considered as bialgebra：As a algebra，its syntax expressions are terms of certain signature；As a coalgebra，its dynamical behavior can be observed through the transition of internal state．Thus，the semantics of process can be investigated by bialgebra． In this paper，the semantics of process are studied by using the bialgebralc methods．Firstly,the bialgebra framework introduced by J．Rutten are given．in- cluding the conditions under which initial algebra semantics and final coalgebra semantics coincide．Secondly,a CCS like process algebra model is presented，and IVits IV its algebra and coMgebra properties axe anMyzed．This model can be unified into the framework of bialgebra when the specification of transition system is pure tyft format in which bisimniation and congruence are coi