## Paper: Equation solving using modal transition systems (at LICS 1990)

Authors:**Larsen, K.G. Xinxin, L.**

### Abstract

This research offers as its main contribution a complete treatment of equation solving within process algebra for equation
systems of the following form: C_{1}(X)~P_{1}, . . ., C _{n(X)}~P_{n} where C_{i} are arbitrary contexts (i.e. derived operators) of some process algebra, P_{i} are arbitrary process (i.e. terms of the process algebra), ~ is the bisimulation equivalence, and X is the unknown process
to be found (if possible). It is shown that the solution set to this equation may be characterized in terms of a distinctive
modal transition system, and that a solution to the above equation systems may be readily extracted (when solutions exist)
on this basis. In fact, the results have led to an implementation (in Prolog) of an automatic tool for solving equations in
the finite-state case

### BibTeX

@InProceedings{LarsenXinxin-Equationsolvingusin, author = {Larsen, K.G. and Xinxin, L.}, title = {Equation solving using modal transition systems}, booktitle = {Proceedings of the Fifth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1990}, year = 1990, editor = {John Mitchell}, month = {June}, pages = {108--117}, location = {Philadelphia, PA, USA}, publisher = {IEEE Computer Society Press} }