Author of the publication

A Proof of the Kahn Principle for Input/Output Automata

, and . Inf. Comput., 82 (1): 81-92 (July 1989)

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

Operational semantics of a focusing debugger., and . Electr. Notes Theor. Comput. Sci., (1995)Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata., and . LICS, page 466-477. IEEE Computer Society, (1998)Composition and Behaviors of Probabilistic I/O Automata., , and . Theor. Comput. Sci., 176 (1-2): 1-38 (1997)Compostional Relational Semantics for Indeterminate Dataflow Networks.. Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science, page 52-74. Springer, (1989)Category Theory with Adjunctions and Limits.. Archive of Formal Proofs, (2016)Monoidal Categories.. Archive of Formal Proofs, (2017)Stability and Sequentiality in Dataflow Networks., , and . ICALP, volume 443 of Lecture Notes in Computer Science, page 308-321. Springer, (1990)Computations, Residuals, and the POwer of Indeterminancy., and . ICALP, volume 317 of Lecture Notes in Computer Science, page 439-454. Springer, (1988)A Process-Algebraic Language for Probabilistic I/O Automata., , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 189-203. Springer, (2003)A Proof of the Kahn Principle for Input/Output Automata, and . Inf. Comput., 82 (1): 81-92 (July 1989)