Author of the publication

A New Typee of Pushdown Automata on Infinite Trees.

, and . Int. J. Found. Comput. Sci., 6 (2): 169-186 (1995)

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

Well-abstracted transition systems: application to FIFO automata., , and . Inf. Comput., 181 (1): 1-31 (2003)Introductory paper., , , , , and . STTT, 5 (4): 299-300 (2004)A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm., , and . STTT, 5 (4): 320-330 (2004)Well-Abstracted Transition Systems., , and . CONCUR, volume 1877 of Lecture Notes in Computer Science, page 566-580. Springer, (2000)An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs., , and . LCR, page 283-286. Springer, (1995)A Formal Methods Approach to Medical Device Review., , and . IEEE Computer, 39 (4): 61-67 (2006)Probabilistic Lossy Channel Systems., and . TAPSOFT, volume 1214 of Lecture Notes in Computer Science, page 667-681. Springer, (1997)Optimality in Abstractions of Model Checking, , and . SAS, volume 983 of Lecture Notes in Computer Science, page 51-63. Springer, (1995)Reasoning about Probabilistic Lossy Channel Systems., , , and . CONCUR, volume 1877 of Lecture Notes in Computer Science, page 320-333. Springer, (2000)Unreliable Channels are Easier to Verify Than Perfect Channels., , and . Inf. Comput., 124 (1): 20-31 (1996)