The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yoram Hirshfeld: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arnon Avron, Yoram Hirshfeld
    On First Order Database Query Languages [Citation Graph (2, 0)][DBLP]
    LICS, 1991, pp:226-231 [Conf]
  2. Yoram Hirshfeld
    Safe Queries in Relational Databases with Functions. [Citation Graph (1, 0)][DBLP]
    CSL, 1991, pp:173-183 [Conf]
  3. Søren Christensen, Yoram Hirshfeld, Faron Moller
    Decidable Subsets of CCS. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1994, v:37, n:4, pp:233-242 [Journal]
  4. Yoram Hirshfeld, Faron Moller
    Decidability Results in Automata and Process Theory. [Citation Graph (0, 0)][DBLP]
    Banff Higher Order Workshop, 1995, pp:102-148 [Conf]
  5. Amnon H. Eden, Yoram Hirshfeld
    Principles in formal specification of object oriented design and architecture. [Citation Graph (0, 0)][DBLP]
    CASCON, 2001, pp:3- [Conf]
  6. Søren Christensen, Yoram Hirshfeld, Faron Moller
    Bisimulation Equivalence is Decidable for Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:143-157 [Conf]
  7. Yoram Hirshfeld, Faron Moller
    A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1994, pp:48-63 [Conf]
  8. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Quantitative Temporal Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:172-187 [Conf]
  9. Yoram Hirshfeld
    Petri Nets and the Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:165-174 [Conf]
  10. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Expressiveness of Metric Modalities for Continuous Time. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:211-220 [Conf]
  11. Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
    Discerning Causality in Interleaving Behavior. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:146-162 [Conf]
  12. Yoram Hirshfeld, Mark Jerrum, Faron Moller
    A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:623-631 [Conf]
  13. Yoram Hirshfeld, Mark Jerrum
    Bisimulation Equivanlence Is Decidable for Normed Process Algebra. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:412-421 [Conf]
  14. Yoram Hirshfeld, Alexander Moshe Rabinovich
    A Framework for Decidable Metrical Logics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:422-432 [Conf]
  15. Søren Christensen, Yoram Hirshfeld, Faron Moller
    Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:386-396 [Conf]
  16. Yoram Hirshfeld, Alexander Moshe Rabinovich
    An Expressive Temporal Logic for Real Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:492-504 [Conf]
  17. Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko
    The Probability Nesting Game. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
  18. Yoram Hirshfeld
    Bisimulation trees and the decidability of weak bisimulations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
  19. Yoram Hirshfeld
    Deterministic concurrent systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:15, n:1, pp:13-36 [Journal]
  20. Yoram Hirshfeld
    Undecidability of Language Equivalence for Generalized Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:26, n:1, pp:95-102 [Journal]
  21. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Logics for Real Time: Decidability and Complexity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:1, pp:1-28 [Journal]
  22. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Future temporal logic needs infinitely many modalities. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:2, pp:196-208 [Journal]
  23. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Timer formulas and decidable metric temporal logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:198, n:2, pp:148-178 [Journal]
  24. Yoram Hirshfeld, Mark Jerrum, Faron Moller
    A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:3, pp:251-259 [Journal]
  25. Yoram Hirshfeld, Mark Jerrum, Faron Moller
    A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:143-159 [Journal]
  26. Yoram Hirshfeld, Faron Moller
    Pushdown automata, multiset automata, and Petri nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:256, n:1-2, pp:3-21 [Journal]
  27. Yoram Hirshfeld, Alexander Rabinovich
    Expressiveness of Metric modalities for continuous time [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  28. Promptness in omega-Regular Automata. [Citation Graph (, )][DBLP]


  29. On the star height of unary regular behaviours. [Citation Graph (, )][DBLP]


  30. Fields, Meadows and Abstract Data Types. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
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