Author of the publication

On a Semantic Subsumption Test.

, , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 142-153. 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

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics, , and . GandALF, volume 96 of EPTCS, page 141-154. (2012)Lipschitz Robustness of Timed I/O Systems., , and . VMCAI, volume 9583 of Lecture Notes in Computer Science, page 250-267. Springer, (2016)From Model Checking to Model Measuring., and . CONCUR, volume 8052 of Lecture Notes in Computer Science, page 273-287. Springer, (2013)Satisfiability versus Finite Satisfiability in Elementary Modal Logics., , and . Fundam. Informaticae, 163 (2): 165-188 (2018)Unification of anti-terms.. UNIF, page 9-14. (2011)Approximate Learning of Limit-Average Automata., and . CONCUR, volume 140 of LIPIcs, page 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On a Semantic Subsumption Test., , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 142-153. Springer, (2004)Computing Average Response Time., , and . Principles of Modeling, volume 10760 of Lecture Notes in Computer Science, page 143-161. Springer, (2018)Quantitative Automata under Probabilistic Semantics., , and . Logical Methods in Computer Science, (2019)Lipschitz Robustness of Finite-state Transducers., , and . FSTTCS, volume 29 of LIPIcs, page 431-443. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)