Author of the publication

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata.

, , and . LATA, volume 8370 of Lecture Notes in Computer Science, page 62-75. Springer, (2014)

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

Better Quasi-Ordered Transition Systems, and . CoRR, (2004)Monotonic Abstraction for Programs with Multiply-Linked Structures., , and . Int. J. Found. Comput. Sci., 24 (2): 187-210 (2013)On the Qualitative Analysis of Conformon P Systems., , and . Workshop on Membrane Computing, volume 5391 of Lecture Notes in Computer Science, page 78-94. Springer, (2008)Bisimulation Minimization of Tree Automata., , and . CIAA, volume 4094 of Lecture Notes in Computer Science, page 173-185. Springer, (2006)Effective Lossy Queue Languages., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 639-651. Springer, (2001)The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO., , and . ESOP, volume 9032 of Lecture Notes in Computer Science, page 308-332. Springer, (2015)Comparing the Expressive Power of Well-Structured Transition Systems., , and . CSL, volume 4646 of Lecture Notes in Computer Science, page 99-114. Springer, (2007)Zenoness for Timed Pushdown Automata., , and . INFINITY, volume 140 of EPTCS, page 35-47. (2013)The Decidability of Verification under Promising 2.0., , , , and . CoRR, (2020)A classification of the expressive power of well-structured transition systems., , and . Inf. Comput., 209 (3): 248-279 (2011)