Antonín Kucera

According to our database1, Antonín Kucera authored at least 142 papers between 1986 and 2018.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata.
J. Comput. Syst. Sci., 2018

Automatic Analysis of Expected Termination Time for Population Protocols.
CoRR, 2018

Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment.
CoRR, 2018

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS.
CoRR, 2018

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Black Ninjas in the Dark: Formal Analysis of Population Protocols.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Solving Patrolling Problems in the Internet Environment.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Trading performance for stability in Markov decision processes.
J. Comput. Syst. Sci., 2017

Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners.
Bulletin of the EATCS, 2017

Efficient Algorithms for Checking Fast Termination in VASS.
CoRR, 2017

Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms.
CoRR, 2017

Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms.
Proceedings of the Quantitative Evaluation of Systems - 14th International Conference, 2017

Synthesis of Optimal Resilient Control Strategies.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration.
CoRR, 2016

Optimizing the Expected Mean Payoff in Energy Markov Decision Processes.
CoRR, 2016

Stability in Graphs and Games.
CoRR, 2016

Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration.
Proceedings of the 24th IEEE International Symposium on Modeling, 2016

Stability in Graphs and Games.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Optimizing the Expected Mean Payoff in Energy Markov Decision Processes.
Proceedings of the Automated Technology for Verification and Analysis, 2016

Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Runtime analysis of probabilistic programs with unbounded recursion.
J. Comput. Syst. Sci., 2015

Long-Run Average Behaviour of Probabilistic Vector Addition Systems.
CoRR, 2015

Strategy Synthesis in Adversarial Patrolling Games.
CoRR, 2015

MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives.
CoRR, 2015

MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Cobra: A Tool for Solving General Deductive Games.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Long-Run Average Behaviour of Probabilistic Vector Addition Systems.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Branching-time model-checking of probabilistic pushdown automata.
J. Comput. Syst. Sci., 2014

Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
J. ACM, 2014

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
Logical Methods in Computer Science, 2014

Strategy Synthesis for General Deductive Games Based on SAT Solving.
CoRR, 2014

Zero-Reachability in Probabilistic Multi-Counter Automata.
CoRR, 2014

Minimizing Running Costs in Consumption Systems.
CoRR, 2014

Zero-reachability in probabilistic multi-counter automata.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Minimizing Running Costs in Consumption Systems.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Solving adversarial patrolling games with bounded error: (extended abstract).
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Joining non-low C.E. sets with diagonally non-computable functions.
J. Log. Comput., 2013

Continuous-time stochastic games with time-bounded reachability.
Inf. Comput., 2013

Approximating the termination value of one-counter MDPs and stochastic games.
Inf. Comput., 2013

Preface.
Fundam. Inform., 2013

Analyzing probabilistic pushdown automata.
Formal Methods in System Design, 2013

The Presburger Award 2014 - Call for Nominations.
Bulletin of the EATCS, 2013

Trading Performance for Stability in Markov Decision Processes
CoRR, 2013

Trading Performance for Stability in Markov Decision Processes.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
Preface.
Theor. Comput. Sci., 2012

Determinacy in Stochastic Games with Unbounded Payoff Functions
CoRR, 2012

Minimizing Expected Termination Time in One-Counter Markov Decision Processes
CoRR, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
CoRR, 2012

Stochastic game logic.
Acta Inf., 2012

Playing Games with Counter Automata.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

Determinacy in Stochastic Games with Unbounded Payoff Functions.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Minimizing Expected Termination Time in One-Counter Markov Decision Processes.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Demuth's Path to Randomness.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Qualitative reachability in stochastic BPA games.
Inf. Comput., 2011

Approximating the Termination Value of One-Counter MDPs and Stochastic Games
CoRR, 2011

Efficient Analysis of Probabilistic Programs with an Unbounded Counter
CoRR, 2011

Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata
CoRR, 2011

Demuth randomness and computational complexity.
Ann. Pure Appl. Logic, 2011

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Runtime Analysis of Probabilistic Programs with Unbounded Recursion.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Approximating the Termination Value of One-Counter MDPs and Stochastic Games.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Measuring performance of continuous-time stochastic processes using timed automata.
Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Effective Analysis of Infinite State Stochastic Processes Games.
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.
Inf. Comput., 2010

Runtime Analysis of Probabilistic Programs with Unbounded Recursion
CoRR, 2010

Qualitative Reachability in Stochastic BPA Games
CoRR, 2010

Reachability Games on Extended Vector Addition Systems with States
CoRR, 2010

One-Counter Markov Decision Processes.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reachability Games on Extended Vector Addition Systems with States.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Stochastic Real-Time Games with Qualitative Timed Automata Objectives.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Low upper bounds of ideals.
J. Symb. Log., 2009

One-Counter Markov Decision Processes
CoRR, 2009

Qualitative Reachability in Stochastic BPA Games.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Continuous-Time Stochastic Games with Time-Bounded Reachability.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Reachability in recursive Markov decision processes.
Inf. Comput., 2008

On the Controller Synthesis for Finite-State Markov Decision Processes.
Fundam. Inform., 2008

Deciding probabilistic bisimilarity over infinite-state probabilistic systems.
Acta Inf., 2008

Discounted Properties of Probabilistic Pushdown Automata.
Proceedings of the Logic for Programming, 2008

The Satisfiability Problem for Probabilistic CTL.
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.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Stochastic Game Logic.
Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

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

A general approach to comparing infinite-state systems with their finite-state specifications.
Theor. Comput. Sci., 2006

Model Checking Probabilistic Pushdown Automata.
Logical Methods in Computer Science, 2006

Methods for Quantitative Analysis of Probabilistic Pushdown Automata.
Electr. Notes Theor. Comput. Sci., 2006

Stochastic Games with Branching-Time Winning Objectives.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Reachability in Recursive Markov Decision Processes.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Model Checking Probabilistic Pushdown Automata
CoRR, 2005

Equivalence-Checking on Infinite-State Systems: Techniques and Results
CoRR, 2005

The stuttering principle revisited.
Acta Inf., 2005

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.
Proceedings of the STACS 2005, 2005

Characteristic Patterns for LTL.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

On the Controller Synthesis for Finite-State Markov Decision Processes.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains.
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).
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.
Inf. Comput., 2004

Model Checking Probabilistic Pushdown Automata.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
The complexity of bisimilarity-checking for one-counter processes.
Theor. Comput. Sci., 2003

A Logical Viewpoint on Process-algebraic Quotients.
J. Log. Comput., 2003

Model checking LTL with regular valuations for pushdown systems.
Inf. Comput., 2003

On Homogeneous Segments.
Proceedings of the Text, Speech and Dialogue, 6th International Conference, 2003

Deciding Bisimilarity between BPA and BPP Processes.
Proceedings of the CONCUR 2003, 2003

2002
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.
Theor. Comput. Sci., 2002

Simulation Preorder over Simple Process Algebras.
Inf. Comput., 2002

Preface.
Electr. Notes Theor. Comput. Sci., 2002

Equivalence-Checking with Infinite-State Systems: Techniques and Results.
Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.
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.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Why Is Simulation Harder than Bisimulation?
Proceedings of the CONCUR 2002, 2002

2001
Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci., 2001

Randomness and Recursive Enumerability.
SIAM J. Comput., 2001

Model-Checking LTL with Regular Valuations for Pushdown Systems.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

2000
Effective decomposability of sequential behaviours.
Theor. Comput. Sci., 2000

Simulation and Bisimulation over One-Counter Processes.
Proceedings of the STACS 2000, 2000

Efficient Verification Algorithms for One-Counter Processes.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

On Simulation-Checking with Sequential Systems.
Proceedings of the Advances in Computing Science, 2000

1999
Lowness for The Class of Random Sets.
J. Symb. Log., 1999

Regularity of Normed PA Processes.
Inf. Process. Lett., 1999

On Finite Representations of Infinite-State Behaviours.
Inf. Process. Lett., 1999

Comparing Expressibility of Normed BPA and Normed BPP Processes.
Acta Inf., 1999

Simulation Preorder on Simple Process Algebras.
Proceedings of the Automata, 1999

A Logical Viewpoint on Process-Algebraic Quotients.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Deciding Bisimulation-Like Equivalences with Finite-State Processes.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Bisimilarity of processes with finite-state systems.
Electr. Notes Theor. Comput. Sci., 1997

On Finite Representations of Infinite-State Behaviours.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

How to Parallelize Sequential Processes.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Bisimilarity is decidable in the union of normed BPA and normed BPP processes.
Electr. Notes Theor. Comput. Sci., 1996

Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Regularity is Decidable for Normed PA Processes in Polynomial Time.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1993
On Relative Randomness.
Ann. Pure Appl. Logic, 1993

1989
On Recursion Theory in I Sigma1.
J. Symb. Log., 1989

1986
An Alternative, Priority-Free, Solution to Post's Problem.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986


  Loading...