Antonín Kucera

David Klaska

Petr Novotný

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Solving adversarial patrolling games with bounded error: (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Continuous-time stochastic games with time-bounded reachability.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Approximating the termination value of one-counter MDPs and stochastic games.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Analyzing probabilistic pushdown automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

The Presburger Award 2014 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

2012

Preface.

[BibT_eX]

[DOI]

Petr Hlinený

Theor. Comput. Sci., 2012

Stochastic game logic.

[BibT_eX]

[DOI]

Acta Informatica, 2012

Playing Games with Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 6th International Workshop, 2012

Determinacy in Stochastic Games with Unbounded Payoff Functions.

[BibT_eX]

[DOI]

Petr Novotný

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Minimizing Expected Termination Time in One-Counter Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Petr Novotný

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

2011

Qualitative reachability in stochastic BPA games.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Measuring performance of continuous-time stochastic processes using timed automata.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Turn-based stochastic games.

[BibT_eX]

Proceedings of the Lectures in Game Theory for Computer Scientists., 2011

2010

Effective Analysis of Infinite State Stochastic Processes Games.

[BibT_eX]

[DOI]

Proceedings of the Logics and Languages for Reliability and Security, 2010

On the complexity of checking semantic equivalences between pushdown processes and finite-state processes.

[BibT_eX]

[DOI]

Inf. Comput., 2010

One-Counter Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reachability Games on Extended Vector Addition Systems with States.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Stochastic Real-Time Games with Qualitative Timed Automata Objectives.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2008

Reachability in recursive Markov decision processes.

[BibT_eX]

[DOI]

Inf. Comput., 2008

On the Controller Synthesis for Finite-State Markov Decision Processes.

[BibT_eX]

[DOI]

Oldrich Strazovský

Fundam. Informaticae, 2008

Deciding probabilistic bisimilarity over infinite-state probabilistic systems.

[BibT_eX]

[DOI]

Oldrich Strazovský

Acta Informatica, 2008

Discounted Properties of Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

The Satisfiability Problem for Probabilistic CTL.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives.

[BibT_eX]

[DOI]

Vojtech Forejt

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

2006

Equivalence-checking on infinite-state systems: Techniques and results.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2006

A general approach to comparing infinite-state systems with their finite-state specifications.

[BibT_eX]

[DOI]

Philippe Schnoebelen

Theor. Comput. Sci., 2006

Model Checking Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

Stochastic Games with Branching-Time Winning Objectives.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

Methods for Quantitative Analysis of Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, 2005

The stuttering principle revisited.

[BibT_eX]

[DOI]

Jan Strejcek

Acta Informatica, 2005

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Oldrich Strazovský

Proceedings of the STACS 2005, 2005

Characteristic Patterns for LTL.

[BibT_eX]

[DOI]

Jan Strejcek

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

DP lower bounds for equivalence-checking and model-checking of one-counter automata.

[BibT_eX]

[DOI]

Inf. Comput., 2004

2003

The complexity of bisimilarity-checking for one-counter processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Logical Viewpoint on Process-algebraic Quotients.

[BibT_eX]

[DOI]

J. Log. Comput., 2003

Model checking LTL with regular valuations for pushdown systems.

[BibT_eX]

[DOI]

Stefan Schwoon

Inf. Comput., 2003

On Homogeneous Segments.

[BibT_eX]

[DOI]

Robert Batusek

Ivan Kopecek

Proceedings of the Text, Speech and Dialogue, 6th International Conference, 2003

Deciding Bisimilarity between BPA and BPP Processes.

[BibT_eX]

[DOI]

Faron Moller

Proceedings of the CONCUR 2003, 2003

2002

Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Simulation Preorder over Simple Process Algebras.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Preface.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), 2002

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2002

The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL.

[BibT_eX]

[DOI]

Jan Strejcek

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Why Is Simulation Harder than Bisimulation?

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

Deciding bisimulation-like equivalences with finite-state processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

Effective decomposability of sequential behaviours.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Simulation and Bisimulation over One-Counter Processes.

[BibT_eX]

[DOI]

Faron Moller

Proceedings of the STACS 2000, 2000

Efficient Verification Algorithms for One-Counter Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

On Simulation-Checking with Sequential Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 2000

1999

Regularity of Normed PA Processes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On Finite Representations of Infinite-State Behaviours.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Comparing Expressibility of Normed BPA and Normed BPP Processes.

[BibT_eX]

[DOI]

Ivana Cerná

Mojmír Kretínský

Acta Informatica, 1999

Simulation Preorder on Simple Process Algebras.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1997

Bisimilarity of processes with finite-state systems.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

How to Parallelize Sequential Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996

Bisimilarity is decidable in the union of normed BPA and normed BPP processes.

[BibT_eX]

[DOI]

Ivana Cerná

Mojmír Kretínský

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Regularity is Decidable for Normed PA Processes in Polynomial Time.

[BibT_eX]

[DOI]