The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Antonín Kucera: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Antonín Kucera
    On Simulation-Checking with Sequential Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2000, pp:133-148 [Conf]
  2. Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
    Reachability in Recursive Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:358-374 [Conf]
  3. Tomás Brázdil, Antonín Kucera, Oldrich Strazovský
    Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:193-208 [Conf]
  4. Petr Jancar, Antonín Kucera, Faron Moller
    Deciding Bisimilarity between BPA and BPP Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:157-171 [Conf]
  5. Antonín Kucera
    How to Parallelize Sequential Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1997, pp:302-316 [Conf]
  6. Antonín Kucera, Richard Mayr
    Why Is Simulation Harder than Bisimulation? [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:594-610 [Conf]
  7. Antonín Kucera, Richard Mayr
    Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:368-382 [Conf]
  8. Antonín Kucera, Ph. Schnoebelen
    A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:371-386 [Conf]
  9. Antonín Kucera, Javier Esparza
    A Logical Viewpoint on Process-Algebraic Quotients. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:499-514 [Conf]
  10. Antonín Kucera, Jan Strejcek
    The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:276-291 [Conf]
  11. Tomás Brázdil, Javier Esparza, Antonín Kucera
    Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:521-530 [Conf]
  12. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:172-186 [Conf]
  13. Tomás Brázdil, Antonín Kucera
    Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:372-383 [Conf]
  14. Antonín Kucera
    Regularity is Decidable for Normed PA Processes in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:111-122 [Conf]
  15. Antonín Kucera, Oldrich Strazovský
    On the Controller Synthesis for Finite-State Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:541-552 [Conf]
  16. Petr Jancar, Antonín Kucera, Richard Mayr
    Deciding Bisimulation-Like Equivalences with Finite-State Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:200-211 [Conf]
  17. Antonín Kucera
    Efficient Verification Algorithms for One-Counter Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:317-328 [Conf]
  18. Antonín Kucera, Richard Mayr
    Simulation Preorder on Simple Process Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:503-512 [Conf]
  19. Antonín Kucera, Richard Mayr
    A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:395-408 [Conf]
  20. Javier Esparza, Antonín Kucera, Richard Mayr
    Model Checking Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:12-21 [Conf]
  21. Javier Esparza, Antonín Kucera, Richard Mayr
    Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:117-126 [Conf]
  22. Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
    Stochastic Games with Branching-Time Winning Objectives. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:349-358 [Conf]
  23. Antonín Kucera
    An Alternative, Priority-Free, Solution to Post's Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:493-500 [Conf]
  24. Antonín Kucera, Richard Mayr
    On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:433-445 [Conf]
  25. Antonín Kucera
    Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:377-392 [Conf]
  26. Antonín Kucera
    On Finite Representations of Infinite-State Behaviours. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:481-488 [Conf]
  27. Antonín Kucera, Petr Jancar
    Equivalence-Checking with Infinite-State Systems: Techniques and Results. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:41-73 [Conf]
  28. Antonín Kucera, Jan Strejcek
    Characteristic Patterns for LTL. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:239-249 [Conf]
  29. Tomás Brázdil, Antonín Kucera, Oldrich Strazovský
    On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:145-157 [Conf]
  30. Petr Jancar, Antonín Kucera, Faron Moller
    Simulation and Bisimulation over One-Counter Processes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:334-345 [Conf]
  31. Javier Esparza, Antonín Kucera, Stefan Schwoon
    Model-Checking LTL with Regular Valuations for Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:316-339 [Conf]
  32. Robert Batusek, Ivan Kopecek, Antonín Kucera
    On Homogeneous Segments. [Citation Graph (0, 0)][DBLP]
    TSD, 2003, pp:152-157 [Conf]
  33. Ivana Cerná, Mojmír Kretínský, Antonín Kucera
    Comparing Expressibility of Normed BPA and Normed BPP Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1999, v:36, n:3, pp:233-256 [Journal]
  34. Antonín Kucera, Jan Strejcek
    The stuttering principle revisited. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:41, n:7-8, pp:415-434 [Journal]
  35. Antonín Kucera
    On Relative Randomness. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:63, n:1, pp:61-67 [Journal]
  36. Ivana Cerná, Mojmír Kretínský, Antonín Kucera
    Bisimilarity is decidable in the union of normed BPA and normed BPP processes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
  37. Petr Jancar, Antonín Kucera
    Bisimilarity of processes with finite-state systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
  38. Antonín Kucera
    Methods for Quantitative Analysis of Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:149, n:1, pp:3-15 [Journal]
  39. Antonín Kucera, Richard Mayr
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:6, pp:- [Journal]
  40. Javier Esparza, Antonín Kucera, Stefan Schwoon
    Model checking LTL with regular valuations for pushdown systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:2, pp:355-376 [Journal]
  41. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    DP lower bounds for equivalence-checking and model-checking of one-counter automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:1-19 [Journal]
  42. Antonín Kucera, Richard Mayr
    Simulation Preorder over Simple Process Algebras. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:184-198 [Journal]
  43. Antonín Kucera
    On Finite Representations of Infinite-State Behaviours. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:1, pp:23-30 [Journal]
  44. Antonín Kucera
    Regularity of Normed PA Processes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:1-2, pp:9-17 [Journal]
  45. Petr Hájek, Antonín Kucera
    On Recursion Theory in I Sigma1. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:576-589 [Journal]
  46. Antonín Kucera, Sebastiaan Terwijn
    Lowness for The Class of Random Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1396-1402 [Journal]
  47. Antonín Kucera, Javier Esparza, Richard Mayr
    Model Checking Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:1, pp:- [Journal]
  48. Antonín Kucera, Javier Esparza
    A Logical Viewpoint on Process-algebraic Quotients. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:6, pp:863-880 [Journal]
  49. Antonín Kucera, Theodore A. Slaman
    Randomness and Recursive Enumerability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:199-211 [Journal]
  50. Petr Jancar, Antonín Kucera, Richard Mayr
    Deciding bisimulation-like equivalences with finite-state processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:409-433 [Journal]
  51. Antonín Kucera
    Effective decomposability of sequential behaviours. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:71-89 [Journal]
  52. Antonín Kucera
    The complexity of bisimilarity-checking for one-counter processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:157-183 [Journal]
  53. Antonín Kucera, Richard Mayr
    Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:677-700 [Journal]
  54. Antonín Kucera, Ph. Schnoebelen
    A general approach to comparing infinite-state systems with their finite-state specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:358, n:2-3, pp:315-333 [Journal]
  55. Antonín Kucera, Petr Jancar
    Equivalence-checking on infinite-state systems: Techniques and results. [Citation Graph (0, 0)][DBLP]
    TPLP, 2006, v:6, n:3, pp:227-264 [Journal]

  56. Stochastic Real-Time Games with Qualitative Timed Automata Objectives. [Citation Graph (, )][DBLP]


  57. Continuous-Time Stochastic Games with Time-Bounded Reachability. [Citation Graph (, )][DBLP]


  58. Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. [Citation Graph (, )][DBLP]


  59. Reachability Games on Extended Vector Addition Systems with States. [Citation Graph (, )][DBLP]


  60. The Satisfiability Problem for Probabilistic CTL. [Citation Graph (, )][DBLP]


  61. Discounted Properties of Probabilistic Pushdown Automata. [Citation Graph (, )][DBLP]


  62. Stochastic Game Logic. [Citation Graph (, )][DBLP]


  63. One-Counter Markov Decision Processes. [Citation Graph (, )][DBLP]


  64. Qualitative Reachability in Stochastic BPA Games. [Citation Graph (, )][DBLP]


  65. Deciding probabilistic bisimilarity over infinite-state probabilistic systems. [Citation Graph (, )][DBLP]


  66. Equivalence-Checking on Infinite-State Systems: Techniques and Results [Citation Graph (, )][DBLP]


  67. Model Checking Probabilistic Pushdown Automata [Citation Graph (, )][DBLP]


  68. One-Counter Markov Decision Processes [Citation Graph (, )][DBLP]


  69. Reachability Games on Extended Vector Addition Systems with States [Citation Graph (, )][DBLP]


  70. Qualitative Reachability in Stochastic BPA Games [Citation Graph (, )][DBLP]


  71. Runtime Analysis of Probabilistic Programs with Unbounded Recursion [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002