, Discounted Properties of Probabilistic Pushdown Automata, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence , and Reasoning (LPAR'08), pp.230-242, 2008.
DOI : 10.1007/978-3-540-89439-1_17
, On the Decidability of Temporal Properties of Probabilistic Pushdown Automata, Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), pp.145-157, 2005.
DOI : 10.1007/978-3-540-31856-9_12
, Regular Canonical Systems, Archiv für Mathematische Logik und Grundlagenforshung 6, pp.91-111, 1964.
, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), Lecture Notes in Computer Science 2914, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10
, An internal presentation of regular graphs by prefix-recognizable ones, Theory of Computing Systems, vol.34, issue.4, 2001.
, Graph rewriting: an algebraic and logic approach, Handbook of Theoretical Computer Science B: Formal Models and Semantics, pp.193-242, 1990.
, Model checking probabilistic pushdown automata, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2006.
DOI : 10.1109/LICS.2004.1319596
URL : http://arxiv.org/abs/cs/0508003
, A logic for reasoning about time and reliability, Formal Aspects of Computing, vol.2, issue.1, pp.512-535, 1994.
DOI : 10.1007/BF01211866
, Methods for Quantitative Analysis of Probabilistic Pushdown Automata, Electronic Notes in Theoretical Computer Science, vol.149, issue.1, pp.3-15, 2006.
DOI : 10.1016/j.entcs.2005.11.013
, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985.
DOI : 10.1016/0304-3975(85)90087-8
, A Decision Method for Elementary Algebra and Geometry, 1951.
DOI : 10.1007/978-3-7091-9459-1_3