Author of the publication

Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract).

, and . TAPSOFT, volume 1214 of Lecture Notes in Computer Science, page 285-296. Springer, (1997)

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

Spi Calculus Translated to ?--Calculus Preserving May-Tests., , and . LICS, page 22-31. IEEE Computer Society, (2004)Web Services as a New Approach to Distributing and Coordinating Semantics-Based Veri cation Toolkits., , , and . WSFM, volume 105 of Electronic Notes in Theoretical Computer Science, page 11-20. Elsevier, (2004)New Concepts of Amalgamation and Extension for a General Theory of Specifications., , and . COMPASS/ADT, volume 655 of Lecture Notes in Computer Science, page 199-221. Springer, (1991)Compositional Constructor Interpretation over Coalgebraic Models for the pi-Calculus.. CMCS, volume 33 of Electronic Notes in Theoretical Computer Science, page 13-41. Elsevier, (2000)Can American Checkers be Solved by Means of Symbolic Model Checking?, , , and . FM-Everywhere@FORTE/PSTV, volume 43 of Electronic Notes in Theoretical Computer Science, page 15-33. Elsevier, (2000)Semantics and logic of higher order processes: characterizing late context bisimulation.. Technical University of Berlin, Germany, (1998)A Fully Abstract Encoding of the pi-Calculus with Data Terms., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 1202-1213. Springer, (2005)First-order Semantics for Higher-order Processes.. HOOTS, volume 41 of Electronic Notes in Theoretical Computer Science, page 50-69. Elsevier, (2000)Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms., , and . Bulletin of the EATCS, (1991)The BDD Space Complexity of Different Forms of Concurrency., and . Fundam. Informaticae, 50 (2): 111-133 (2002)