Antonín Kučera

From MaRDI portal
Person:235697

Available identifiers

zbMath Open kucera.antonin.1MaRDI QIDQ235697

List of research outcomes

PublicationDate of PublicationType
The satisfiability problem for a quantitative fragment of PCTL2023-10-24Paper
Satisfiability of quantitative probabilistic CTL: rise to the challenge2023-08-10Paper
Synthesis of Optimal Resilient Control Strategies2022-08-12Paper
Automatic Analysis of Expected Termination Time for Population Protocols2021-08-04Paper
Checking qualitative liveness properties of replicated systems with stochastic scheduling2021-02-09Paper
Efficient Analysis of VASS Termination Complexity2021-01-21Paper
Black Ninjas in the Dark2021-01-20Paper
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS2021-01-20Paper
Deciding Fast Termination for Probabilistic VASS with Nondeterminism2020-07-20Paper
Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms2019-09-17Paper
Optimizing the expected mean payoff in energy Markov decision processes2018-10-25Paper
Zero-reachability in probabilistic multi-counter automata2018-04-23Paper
Long-Run Average Behaviour of Probabilistic Vector Addition Systems2018-04-23Paper
Stability in Graphs and Games2018-03-21Paper
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata2017-10-11Paper
Trading Performance for Stability in Markov Decision Processes2017-07-03Paper
Measuring performance of continuous-time stochastic processes using timed automata2017-05-16Paper
Trading performance for stability in Markov decision processes2016-11-14Paper
Regularity of normed PA processes2016-06-16Paper
Cobra: A Tool for Solving General Deductive Games2016-01-12Paper
On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS2015-09-29Paper
Efficient Analysis of Probabilistic Programs with an Unbounded Counter2015-08-14Paper
Runtime analysis of probabilistic programs with unbounded recursion2014-09-22Paper
Analyzing probabilistic pushdown automata2014-06-30Paper
https://portal.mardi4nfdi.de/entity/Q54176732014-05-22Paper
Markov Decision Processes with Multiple Long-run Average Objectives2014-03-24Paper
Branching-time model-checking of probabilistic pushdown automata2014-01-28Paper
https://portal.mardi4nfdi.de/entity/Q28520132013-10-07Paper
Approximating the termination value of one-counter MDPs and stochastic games2013-06-06Paper
Continuous-time stochastic games with time-bounded reachability2013-06-06Paper
Playing Games with Counter Automata2013-01-07Paper
Minimizing Expected Termination Time in One-Counter Markov Decision Processes2012-11-01Paper
Continuous-Time Stochastic Games with Time-Bounded Reachability.2012-10-24Paper
Stochastic game logic2012-10-15Paper
Qualitative Reachability in Stochastic BPA Games2012-04-24Paper
https://portal.mardi4nfdi.de/entity/Q32240962012-03-29Paper
Qualitative reachability in stochastic BPA games2011-10-10Paper
https://portal.mardi4nfdi.de/entity/Q31725312011-10-05Paper
Runtime Analysis of Probabilistic Programs with Unbounded Recursion2011-07-07Paper
Approximating the Termination Value of One-Counter MDPs and Stochastic Games2011-07-07Paper
Equivalence-Checking with Infinite-State Systems: Techniques and Results2011-04-01Paper
https://portal.mardi4nfdi.de/entity/Q30609812010-12-13Paper
Reachability Games on Extended Vector Addition Systems with States2010-09-07Paper
Stochastic Real-Time Games with Qualitative Timed Automata Objectives2010-08-31Paper
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes2010-08-18Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
Discounted Properties of Probabilistic Pushdown Automata2009-01-27Paper
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives2008-08-19Paper
Reachability in recursive Markov decision processes2008-05-19Paper
Deciding probabilistic bisimilarity over infinite-state probabilistic systems2008-04-23Paper
https://portal.mardi4nfdi.de/entity/Q54501162008-03-19Paper
Model Checking Probabilistic Pushdown Automata2007-10-11Paper
Reachability in Recursive Markov Decision Processes2007-09-04Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
A general approach to comparing infinite-state systems with their finite-state specifications2006-09-13Paper
Equivalence-checking on infinite-state systems: Techniques and results2006-07-14Paper
https://portal.mardi4nfdi.de/entity/Q57144472006-01-02Paper
SOFSEM 2005: Theory and Practice of Computer Science2005-12-07Paper
STACS 20052005-12-02Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
The stuttering principle revisited2005-08-02Paper
https://portal.mardi4nfdi.de/entity/Q46734212005-04-29Paper
Model checking LTL with regular valuations for pushdown systems2004-11-23Paper
DP lower bounds for equivalence-checking and model-checking of one-counter automata2004-11-23Paper
A Logical Viewpoint on Process-algebraic Quotients2004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q47382252004-08-11Paper
The complexity of bisimilarity-checking for one-counter processes.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44118292003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q47085922003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q44845132003-06-12Paper
Simulation preorder over simple process algebras2003-01-14Paper
On finite representations of infinite-state behaviours2002-07-25Paper
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27665322002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27541542001-11-11Paper
Deciding bisimulation-like equivalences with finite-state processes2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45015452000-09-04Paper
Effective decomposability of sequential behaviours2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49452472000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q42700701999-12-20Paper
Comparing expressibility of normed BPA and normed BPP processes1999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42230691999-01-03Paper
https://portal.mardi4nfdi.de/entity/Q42228691998-12-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Antonín Kučera