暂无分享,去创建一个
Christel Baier | James Worrell | Markus A. Whiteland | Florian Luca | Florian Funke | Simon Jantsch | Engel Lefaucheux | David Purser | Joel Ouaknine | C. Baier | J. Ouaknine | J. Worrell | F. Luca | Florian Funke | Simon Jantsch | D. Purser | Engel Lefaucheux | David Purser
[1] Joël Ouaknine,et al. The Polytope-Collision Problem , 2017, ICALP.
[2] D. Masser,et al. Intersecting curves and algebraic subgroups: conjectures and more results , 2005 .
[3] I. Shparlinski,et al. On the Skolem problem and some related questions for parametric families of linear recurrence sequences , 2020, Canadian Journal of Mathematics.
[4] Richard J. Lipton,et al. Polynomial-time algorithm for the orbit problem , 1986, JACM.
[5] Joël Ouaknine,et al. Reachability problems for Markov chains , 2015, Inf. Process. Lett..
[6] Christel Baier,et al. On Skolem-hardness and saturation points in Markov decision processes , 2020, ICALP.
[7] T. Browning,et al. Local Fields , 2008 .
[8] Kim Guldstrand Larsen,et al. Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[9] Joël Ouaknine,et al. Decision Problems for Linear Recurrence Sequences , 2012, SCSS.
[10] Kunrui Yu,et al. p-adic logarithmic forms and group varieties II , 1999 .
[11] Joël Ouaknine,et al. The orbit problem in higher dimensions , 2013, STOC '13.
[12] Mahesh Viswanathan,et al. Model Checking MDPs with a Unique Compact Invariant Set of Distributions , 2011, 2011 Eighth International Conference on Quantitative Evaluation of SysTems.
[13] Joël Ouaknine,et al. On the Skolem Problem for Continuous Linear Dynamical Systems , 2015, ICALP.
[14] Lubos Brim,et al. Precise parameter synthesis for stochastic biochemical systems , 2014, Acta Informatica.
[15] D. Masser,et al. Intersecting a plane with algebraic subgroups of multiplicative groups , 1999 .
[16] C. R. Ramakrishnan,et al. Model Repair for Probabilistic Systems , 2011, TACAS.
[17] Gisbert Wüstholz,et al. Logarithmic forms and group varieties. , 1993 .
[18] J. Berstel,et al. Deux propriétés décidables des suites récurrentes linéaires , 1976 .
[19] H. T. Kung,et al. All Algebraic Functions Can Be Computed Fast , 1978, JACM.
[20] A. Bobenko. Compact Riemann Surfaces , 2005 .
[21] Nils Jansen,et al. A Greedy Approach for the Efficient Repair of Stochastic Models , 2015, NFM.
[22] Robert Givan,et al. Bounded-parameter Markov decision processes , 2000, Artif. Intell..
[23] Joël Ouaknine,et al. The Polyhedron-Hitting Problem , 2014, SODA.
[24] M. Waldschmidt. Heights of Algebraic Numbers , 2000 .
[25] C. Woodcock. LOCAL FIELDS (London Mathematical Society Student Texts 3) , 1987 .
[26] Gul A. Agha,et al. Linear Inequality LTL (iLTL): A Model Checker for Discrete Time Markov Chains , 2004, ICFEM.
[27] T. Shorey,et al. The distance between terms of an algebraic recurrence sequence. , 1984 .
[28] Kunrui Yu. P-ADIC LOGARITHMIC FORMS AND GROUP VARIETIES I , 1998 .
[29] Pascal Koiran,et al. Quantum automata and algebraic groups , 2005, J. Symb. Comput..
[30] S. Basu,et al. Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .
[31] N. Vereshchagin. Occurrence of zero in a linear recursive sequence , 1985 .
[32] Rupak Majumdar,et al. On Decidability of Time-bounded Reachability in CTMDPs , 2020, ICALP.
[33] Andrea Maggiolo-Schettini,et al. Parametric probabilistic transition systems for system design and analysis , 2007, Formal Aspects of Computing.
[34] Mahesh Viswanathan,et al. Reasoning about MDPs as Transformers of Probability Distributions , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.
[35] Sebastian Junges,et al. Parameter Synthesis for Markov Models , 2019, Formal Methods in System Design.
[36] P. Habegger. Quasi-equivalence of Heights and Runge's Theorem , 2016, 1608.04206.
[37] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[38] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .
[39] Sebastian Junges,et al. Synthesis in pMDPs: A Tale of 1001 Parameters , 2018, ATVA.
[40] Michael A. Harrison,et al. Lectures on linear sequential machines , 1969 .
[41] Christel Baier,et al. Reachability in Dynamical Systems with Rounding , 2020, FSTTCS.
[42] Lev V. Utkin,et al. Interval-Valued Finite Markov Chains , 2002, Reliab. Comput..
[43] J. Evertse,et al. Effective results for points on certain subvarieties of tori , 2009, Mathematical Proceedings of the Cambridge Philosophical Society.
[44] Joël Ouaknine,et al. On the Positivity Problem for Simple Linear Recurrence Sequences, , 2013, ICALP.
[45] M. Mignotte. Some Useful Bounds , 1983 .
[46] Between Decidability. Skolem's Problem - On the Border , 2005 .
[47] David A. Cox,et al. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .