The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jirí Srba: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mogens Nielsen, Vladimiro Sassone, Jirí Srba
    Towards a Notion of Distributed Time for Petri Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2001, pp:23-31 [Conf]
  2. Jirí Srba
    Timed-Arc Petri Nets vs. Networks of Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2005, pp:385-402 [Conf]
  3. Giorgio Delzanno, Javier Esparza, Jirí Srba
    Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:415-429 [Conf]
  4. Jirí Srba
    On the Power of Labels in Transition Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:277-291 [Conf]
  5. Jirí Srba
    Undecidability of Weak Bisimilarity for Pushdown Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:579-593 [Conf]
  6. Jirí Srba
    Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:89-103 [Conf]
  7. Jirí Srba
    Undecidability of Weak Bisimilarity for PA-Processes. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:197-208 [Conf]
  8. Petr Jancar, Jirí Srba
    Undecidability Results for Bisimilarity on Prefix Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:277-291 [Conf]
  9. Jirí Srba
    Note on the Tableau Technique for Commutative Transition Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:387-401 [Conf]
  10. Mogens Nielsen, Vladimiro Sassone, Jirí Srba
    Properties of Distributed Timed-Arc Petri Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:280-291 [Conf]
  11. Jirí Srba
    On Counting the Number of Consistent Genotype Assignments for Pedigrees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:470-482 [Conf]
  12. Jirí Srba
    Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:716-727 [Conf]
  13. Petr Jancar, Jirí Srba
    Highly Undecidable Questions for Process Algebras. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:507-520 [Conf]
  14. Ondrej Klíma, Jirí Srba
    Matching Modulo Associativity and Idempotency Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:456-466 [Conf]
  15. Jirí Srba
    Deadlocking States in Context-Free Process Algebra. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:388-398 [Conf]
  16. Ivana Cerná, Ondrej Klíma, Jirí Srba
    Pattern Equations and Equations with Stuttering. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:369-378 [Conf]
  17. Hans Hüttel, Jirí Srba
    Recursion Versus Replication in Simple Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:178-187 [Conf]
  18. Jirí Srba
    Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:535-546 [Conf]
  19. Jirí Srba
    Strong bisimilarity of simple process algebras: complexity lower bounds. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:6-7, pp:469-499 [Journal]
  20. Jirí Srba
    Roadmap of Infinite Results. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:78, n:, pp:163-175 [Journal]
  21. Jirí Srba
    Complexity of Weak Bisimilarity and Regularity for BPA and BPP. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:39, n:1, pp:- [Journal]
  22. Jirí Srba
    Completeness Results for Undecidable Bisimilarity Problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:5-19 [Journal]
  23. Jirí Srba, Scott A. Smolka
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:149, n:1, pp:1-2 [Journal]
  24. Marcin Jurdzinski, Mogens Nielsen, Jirí Srba
    Undecidability of domino games and hhp-bisimilarity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:2, pp:343-368 [Journal]
  25. Faron Moller, Scott A. Smolka, Jirí Srba
    On the computational complexity of bisimulation, redux. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:2, pp:129-143 [Journal]
  26. Hans Hüttel, Jirí Srba
    Decidability Issues for Extended Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:36, n:1-2, pp:125-147 [Journal]
  27. Jirí Srba
    Complexity Of Weak Bisimilarity And Regularity For Bpa And Bpp. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:4, pp:567-587 [Journal]
  28. Jirí Srba
    Basic process algebra with deadlocking states. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:605-630 [Journal]
  29. Dirk Nowotka, Jirí Srba
    Height-Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:125-134 [Conf]

  30. TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets. [Citation Graph (, )][DBLP]


  31. Infinite Runs in Weighted Timed Automata with Energy Constraints. [Citation Graph (, )][DBLP]


  32. Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets. [Citation Graph (, )][DBLP]


  33. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. [Citation Graph (, )][DBLP]


  34. An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata. [Citation Graph (, )][DBLP]


  35. Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. [Citation Graph (, )][DBLP]


  36. Teaching Concurrency: Theory in Practice. [Citation Graph (, )][DBLP]


  37. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains [Citation Graph (, )][DBLP]


  38. Beyond Language Equivalence on Visibly Pushdown Automata [Citation Graph (, )][DBLP]


Search in 0.146secs, Finished in 0.147secs
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