Author of the publication

Decomposing Verification of Timed I/O Automata.

, and . FORMATS/FTRTFT, volume 3253 of Lecture Notes in Computer Science, page 84-101. Springer, (2004)

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

Efficient Searching Using Partial Ordering., , , and . Inf. Process. Lett., 12 (2): 71-75 (1981)The impossibility of boosting distributed service resilience., , , , and . Inf. Comput., 209 (6): 927-950 (2011)Relative Complexity of Algebras., and . Mathematical Systems Theory, (1981)Straight-Line Program Length as a Parameter for Complexity Analysis.. J. Comput. Syst. Sci., 21 (3): 251-280 (1980)Upper Bounds for Static Resource Allocation in a Distributed System.. J. Comput. Syst. Sci., 23 (2): 254-278 (1981)An Upper and Lower Bound for Clock Synchronization, and . Information and Control, 62 (2/3): 190-204 (August 1984)Verifying timing properties of concurrent algorithms., , , and . FORTE, volume 6 of IFIP Conference Proceedings, page 259-273. Chapman & Hall, (1994)Observing Branching Structure through Probabilistic Contexts., , and . SIAM J. Comput., 37 (4): 977-1013 (2007)Totally Ordered Multicast with Bounded Delays and Variable Rates., , , and . OPODIS, page 143-162. Suger, Saint-Denis, rue Catulienne, France, (2000)Hybrid Atomicity for Nested Transactions., , and . Theor. Comput. Sci., 149 (1): 151-178 (1995)preliminary version: ICDT 1992: 216-230.