Stefan Kiefer

Inf. Process. Lett., 2013

A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Algorithmic probabilistic game semantics - Playing games with automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

Analyzing probabilistic pushdown automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Bisimilarity of Pushdown Automata is Nonelementary.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

Space-efficient scheduling of stochastically generated tasks.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Three tokens in Herman's algorithm.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

Bisimilarity of Pushdown Systems is Nonelementary

[BibT_eX]

[DOI]

CoRR, 2012

Stabilization of Branching Queueing Networks.

[BibT_eX]

[DOI]

Tomás Brázdil

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Model Checking Stochastic Branching Processes.

[BibT_eX]

[DOI]

Taolue Chen

Klaus Dräger

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Bisimilarity of Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

On the Complexity of the Equivalence Problem for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

APEX: An Analyzer for Open Probabilistic Programs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Proving Termination of Probabilistic Programs Using Patterns.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

Derivation tree analysis for accelerated fixed-point computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Parikhʼs theorem: A simple and direct automaton construction.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

On Probabilistic Parallel Programs with Process Creation and Synchronisation.

[BibT_eX]

[DOI]

Dominik Wojtczak

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

On Stabilization in Herman's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Language Equivalence for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010

Solving Systems of Positive Polynomial Equations (Lösung positiver polynomieller Gleichungssysteme)

[BibT_eX]

[DOI]

PhD thesis, 2010

Computing the Least Fixed Point of Positive Polynomial Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Newtonian program analysis.

[BibT_eX]

[DOI]

J. ACM, 2010

Parikh's Theorem: A simple and direct construction

[BibT_eX]

[DOI]

CoRR, 2010

Computing Least Fixed Points of Probabilistic Systems of Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009

On least fixed points of systems of positive polynomials.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2009

On the Memory Consumption of Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Tomás Brázdil

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

Solving Fixed-Point Equations on omega-Continuous Semirings.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

2008

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.

[BibT_eX]

[DOI]

Stefan Schwoon

J. Satisf. Boolean Model. Comput., 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Solving Monotone Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Newton's Method for omega-Continuous Semirings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

On the convergence of Newton's method for monotone systems of polynomial equations.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On Fixed Point Equations over Commutative Semirings.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

An Extension of Newton's Method to <i>omega</i> -Continuous Semirings.

[BibT_eX]

[DOI]