Author of the publication

A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems.

, and . Inf. Process. Lett., 29 (2): 57-66 (1988)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The algebra of binary trees is affine complete., , , and . CoRR, (2020)Affine Completeness of Some Free Binary Algebras., , and . Fundam. Informaticae, 186 (1-4): 27-44 (2022)MEC: A System for Constructing and Analysis Transition Systems.. AMAST, page 81-82. Springer, (1991)Synchronized Products of Transition Systems and Their Analysis.. ICATPN, volume 1420 of Lecture Notes in Computer Science, page 26-27. Springer, (1998)Théorie des magmoïdes., and . RAIRO Theor. Informatics Appl., 12 (3): 235-257 (1978)p329 The µ-calculus alternation-depth hierarchy is strict on binary trees.. RAIRO Theor. Informatics Appl., 33 (4/5): 329-340 (1999)Sémantique des Processus Communicants.. RAIRO Theor. Informatics Appl., 15 (2): 103-139 (1981)A Selection Property of the Boolean µ-Calculus and Some of its Applications.. RAIRO Theor. Informatics Appl., 31 (4): 371-384 (1997)Continuous Separation of Game Languages., and . Fundam. Informaticae, 81 (1-3): 19-28 (2007)A generic approach to the control of discrete event systems., , , and . CDC/ECC, page 1-5. IEEE, (2005)