| 2012 | ||
|---|---|---|
| j16 | Yoram Hirshfeld, Alexander Rabinovich: Continuous time temporal logic with counting. Inf. Comput. 214: 1-9 (2012) | |
| 2010 | ||
| c18 | Shaull Almagor, Yoram Hirshfeld, Orna Kupferman: Promptness in omega-Regular Automata. ATVA 2010: 22-36 | |
| 2009 | ||
| j15 | Jan A. Bergstra, Yoram Hirshfeld, J. V. Tucker: Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009) | |
| 2008 | ||
| j14 | Yoram Hirshfeld, Alexander Moshe Rabinovich: Decidable metric logics. Inf. Comput. 206(12): 1425-1442 (2008) | |
| c17 | Jan A. Bergstra, Yoram Hirshfeld, John Tucker: Fields, Meadows and Abstract Data Types. Pillars of Computer Science 2008: 166-178 | |
| 2007 | ||
| j13 | Yoram Hirshfeld, Alexander Rabinovich: Expressiveness of Metric modalities for continuous time. Logical Methods in Computer Science 3(1) (2007) | |
| 2006 | ||
| c16 | Yoram Hirshfeld, Alexander Moshe Rabinovich: Expressiveness of Metric Modalities for Continuous Time. CSR 2006: 211-220 | |
| c15 | Yoram Hirshfeld, Alexander Moshe Rabinovich: An Expressive Temporal Logic for Real Time. MFCS 2006: 492-504 | |
| i1 | Yoram Hirshfeld, Alexander Rabinovich: Expressiveness of Metric modalities for continuous time. CoRR abs/cs/0611119 (2006) | |
| 2005 | ||
| j12 | Yoram Hirshfeld, Alexander Moshe Rabinovich: Timer formulas and decidable metric temporal logic. Inf. Comput. 198(2): 148-178 (2005) | |
| 2004 | ||
| j11 | Yoram Hirshfeld, Alexander Moshe Rabinovich: Logics for Real Time: Decidability and Complexity. Fundam. Inform. 62(1): 1-28 (2004) | |
| 2003 | ||
| j10 | Yoram Hirshfeld, Alexander Moshe Rabinovich: Future temporal logic needs infinitely many modalities. Inf. Comput. 187(2): 196-208 (2003) | |
| 2002 | ||
| j9 | Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko: The Probability Nesting Game. Electr. Notes Theor. Comput. Sci. 68(2): 4-14 (2002) | |
| 2001 | ||
| j8 | Yoram Hirshfeld, Faron Moller: Pushdown automata, multiset automata, and Petri nets. Theor. Comput. Sci. 256(1-2): 3-21 (2001) | |
| c14 | Amnon H. Eden, Yoram Hirshfeld: Principles in formal specification of object oriented design and architecture. CASCON 2001: 3 | |
| 2000 | ||
| c13 | Yoram Hirshfeld, Faron Moller: On the star height of unary regular behaviours. Proof, Language, and Interaction 2000: 497-510 | |
| 1999 | ||
| c12 | ||
| c11 | Yoram Hirshfeld, Mark Jerrum: Bisimulation Equivanlence Is Decidable for Normed Process Algebra. ICALP 1999: 412-421 | |
| c10 | Yoram Hirshfeld, Alexander Moshe Rabinovich: A Framework for Decidable Metrical Logics. ICALP 1999: 422-432 | |
| 1996 | ||
| j7 | Yoram Hirshfeld: Bisimulation trees and the decidability of weak bisimulations. Electr. Notes Theor. Comput. Sci. 5: 2-13 (1996) | |
| j6 | Yoram Hirshfeld: Undecidability of Language Equivalence for Generalized Regular Expressions. Fundam. Inform. 26(1): 95-102 (1996) | |
| j5 | Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. Mathematical Structures in Computer Science 6(3): 251-259 (1996) | |
| j4 | Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. 158(1&2): 143-159 (1996) | |
| 1995 | ||
| c9 | Yoram Hirshfeld, Faron Moller: Decidability Results in Automata and Process Theory. Banff Higher Order Workshop 1995: 102-148 | |
| 1994 | ||
| j3 | Søren Christensen, Yoram Hirshfeld, Faron Moller: Decidable Subsets of CCS. Comput. J. 37(4): 233-242 (1994) | |
| j2 | Arnon Avron, Yoram Hirshfeld: Queries evaluation, relative safety, and domain independence in first-order database languages with functions. Meth. of Logic in CS 1(3): 261-277 (1994) | |
| c8 | Yoram Hirshfeld, Faron Moller: A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. CONCUR 1994: 48-63 | |
| c7 | Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes. FOCS 1994: 623-631 | |
| 1993 | ||
| c6 | Søren Christensen, Yoram Hirshfeld, Faron Moller: Bisimulation Equivalence is Decidable for Basic Parallel Processes. CONCUR 1993: 143-157 | |
| c5 | ||
| c4 | Søren Christensen, Yoram Hirshfeld, Faron Moller: Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes. LICS 1993: 386-396 | |
| 1991 | ||
| j1 | ||
| c3 | ||
| c2 | ||
| 1989 | ||
| c1 | Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Discerning Causality in Interleaving Behavior. Logic at Botik 1989: 146-162 | |
Colors in the list of coauthors
Last update Tue May 21 21:16:04 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page