Antonín Kucera - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Stochastic Real-Time Games with Qualitative Timed Automata ObjectivesTomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák. concur 2010: 207-221 [doi]

Reachability Games on Extended Vector Addition Systems with StatesTomás Brázdil, Petr Jancar, Antonín Kucera. icalp 2010: 478-489 [doi]

One-Counter Markov Decision ProcessesTomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak. soda 2010: 863-874 [doi]

Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. ProceedingsPetr Hlinený, Antonín Kucera, editors, Volume 6281 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. ProceedingsAntonín Kucera, Igor Potapov, editors, Volume 6227 of Lecture Notes in Computer Science, Springer, 2010. [doi]

On the complexity of checking semantic equivalences between pushdown processes and finite-state processesAntonín Kucera, Richard Mayr. iandc, 208(7):772-796, 2010. [doi]

2009

Qualitative Reachability in Stochastic BPA GamesTomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek. STACS 2009: 207-218 [doi]

Low upper bounds of idealsAntonín Kucera, Theodore A. Slaman. JSYML, 74(2):517-534, 2009. [doi]

SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. ProceedingsMogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia, editors, Volume 5404 of Lecture Notes in Computer Science, Springer, 2009. [doi]

2008

Deciding probabilistic bisimilarity over infinite-state probabilistic systemsTomás Brázdil, Antonín Kucera, Oldrich Strazovský. ACTA, 45(2):131-154, 2008. [doi]

The Satisfiability Problem for Probabilistic CTLTomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera. lics 2008: 391-402 [doi]

Discounted Properties of Probabilistic Pushdown AutomataTomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera. lpar 2008: 230-242 [doi]

Reachability in recursive Markov decision processesTomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera. iandc, 206(5):520-537, 2008. [doi]

Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time ObjectivesTomás Brázdil, Vojtech Forejt, Antonín Kucera. icalp 2008: 148-159 [doi]

On the Controller Synthesis for Finite-State Markov Decision ProcessesAntonín Kucera, Oldrich Strazovský. FUIN, 82(1-2):141-153, 2008. [doi]

2007

Stochastic Game LogicChristel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera. qest 2007: 227-236 [doi]

Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, ProceedingsLudek Kucera, Antonín Kucera, editors, Volume 4708 of Lecture Notes in Computer Science, Springer, 2007.

2006

2005

On the Decidability of Temporal Properties of Probabilistic Pushdown AutomataTomás Brázdil, Antonín Kucera, Oldrich Strazovský. STACS 2005: 145-157 [doi]

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov ChainsTomás Brázdil, Antonín Kucera. fsttcs 2005: 372-383 [doi]

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)Tomás Brázdil, Javier Esparza, Antonín Kucera. focs 2005: 521-530 [doi]

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and VariancesJavier Esparza, Antonín Kucera, Richard Mayr. lics 2005: 117-126 [doi]

Characteristic Patterns for LTLAntonín Kucera, Jan Strejcek. sofsem 2005: 239-249 [doi]

The stuttering principle revisitedAntonín Kucera, Jan Strejcek. ACTA, 41(7-8):415-434, 2005. [doi]

On the Controller Synthesis for Finite-State Markov Decision ProcessesAntonín Kucera, Oldrich Strazovský. fsttcs 2005: 541-552 [doi]

2004

2003

On Homogeneous SegmentsRobert Batusek, Ivan Kopecek, Antonín Kucera. TSD 2003: 152-157 [doi]

Model checking LTL with regular valuations for pushdown systemsJavier Esparza, Antonín Kucera, Stefan Schwoon. iandc, 186(2):355-376, 2003. [doi]

Deciding Bisimilarity between BPA and BPP ProcessesPetr Jancar, Antonín Kucera, Faron Moller. concur 2003: 157-171 [doi]

The complexity of bisimilarity-checking for one-counter processesAntonín Kucera. TCS, 1-3(304):157-183, 2003. [doi]

A Logical Viewpoint on Process-algebraic QuotientsAntonín Kucera, Javier Esparza. logcom, 13(6):863-880, 2003. [doi]

2002

CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, ProceedingsLubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera, editors, Volume 2421 of Lecture Notes in Computer Science, Springer, 2002.

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower BoundsPetr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa. fossacs 2002: 172-186 [doi]

Equivalence-Checking with Infinite-State Systems: Techniques and ResultsAntonín Kucera, Petr Jancar. sofsem 2002: 41-73 [doi]

PrefaceAntonín Kucera, Richard Mayr. ENTCS, 68(6), 2002. [doi]

On the Complexity of Semantic Equivalences for Pushdown Automata and BPAAntonín Kucera, Richard Mayr. mfcs 2002: 433-445 [doi]

Why Is Simulation Harder than Bisimulation?Antonín Kucera, Richard Mayr. concur 2002: 594-610 [doi]

Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial timeAntonín Kucera, Richard Mayr. TCS, 270(1-2):677-700, 2002. [doi]

The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTLAntonín Kucera, Jan Strejcek. csl 2002: 276-291 [doi]

Simulation Preorder over Simple Process AlgebrasAntonín Kucera, Richard Mayr. iandc, 173(2):184-198, 2002. [doi]

2001

Model-Checking LTL with Regular Valuations for Pushdown SystemsJavier Esparza, Antonín Kucera, Stefan Schwoon. tacs 2001: 316-339 [doi]

Deciding bisimulation-like equivalences with finite-state processesPetr Jancar, Antonín Kucera, Richard Mayr. TCS, 258(1-2):409-433, 2001. [doi]

Randomness and Recursive EnumerabilityAntonín Kucera, Theodore A. Slaman. siamcomp, 31(1):199-211, 2001. [doi]

2000

Simulation and Bisimulation over One-Counter ProcessesPetr Jancar, Antonín Kucera, Faron Moller. STACS 2000: 334-345 [doi]

Effective decomposability of sequential behavioursAntonín Kucera. TCS, 242(1-2):71-89, 2000. [doi]

On Simulation-Checking with Sequential SystemsAntonín Kucera. asian 2000: 133-148 [doi]

Efficient Verification Algorithms for One-Counter ProcessesAntonín Kucera. icalp 2000: 317-328 [doi]

1999

1998

Deciding Bisimulation-Like Equivalences with Finite-State ProcessesPetr Jancar, Antonín Kucera, Richard Mayr. icalp 1998: 200-211 [doi]

1997

Bisimilarity of processes with finite-state systemsPetr Jancar, Antonín Kucera. ENTCS, 9, 1997. [doi]

On Finite Representations of Infinite-State BehavioursAntonín Kucera. sofsem 1997: 481-488

How to Parallelize Sequential ProcessesAntonín Kucera. concur 1997: 302-316

1996

Bisimilarity is decidable in the union of normed BPA and normed BPP processesIvana Cerná, Mojmír Kretínský, Antonín Kucera. ENTCS, 5, 1996. [doi]

Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial TimeAntonín Kucera. sofsem 1996: 377-392

Regularity is Decidable for Normed PA Processes in Polynomial TimeAntonín Kucera. fsttcs 1996: 111-122

1993

On Relative RandomnessAntonín Kucera. APAL, 63(1):61-67, 1993.

1989

On Recursion Theory in I Sigma::1::Petr Hájek, Antonín Kucera. JSYML, 54(2):576-589, 1989.

1986

An Alternative, Priority-Free, Solution to Post s ProblemAntonín Kucera. mfcs 1986: 493-500