| 2009 |
|---|
| 32 | EE | 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 |
|---|
| 31 | EE | Jan A. Bergstra,
Yoram Hirshfeld,
John Tucker:
Fields, Meadows and Abstract Data Types.
Pillars of Computer Science 2008: 166-178 |
| 30 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Decidable metric logics.
Inf. Comput. 206(12): 1425-1442 (2008) |
| 2007 |
|---|
| 29 | EE | Yoram Hirshfeld,
Alexander Rabinovich:
Expressiveness of Metric modalities for continuous time.
Logical Methods in Computer Science 3(1): (2007) |
| 2006 |
|---|
| 28 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Expressiveness of Metric Modalities for Continuous Time.
CSR 2006: 211-220 |
| 27 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
An Expressive Temporal Logic for Real Time.
MFCS 2006: 492-504 |
| 26 | EE | Yoram Hirshfeld,
Alexander Rabinovich:
Expressiveness of Metric modalities for continuous time
CoRR abs/cs/0611119: (2006) |
| 2005 |
|---|
| 25 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Timer formulas and decidable metric temporal logic.
Inf. Comput. 198(2): 148-178 (2005) |
| 2004 |
|---|
| 24 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Logics for Real Time: Decidability and Complexity.
Fundam. Inform. 62(1): 1-28 (2004) |
| 2003 |
|---|
| 23 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Future temporal logic needs infinitely many modalities.
Inf. Comput. 187(2): 196-208 (2003) |
| 2002 |
|---|
| 22 | EE | Danièle Beauquier,
Yoram Hirshfeld,
Alexander Moshe Rabinovich,
Anatol Slissenko:
The Probability Nesting Game.
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
| 2001 |
|---|
| 21 | EE | Amnon H. Eden,
Yoram Hirshfeld:
Principles in formal specification of object oriented design and architecture.
CASCON 2001: 3 |
| 20 | EE | Yoram Hirshfeld,
Faron Moller:
Pushdown automata, multiset automata, and Petri nets.
Theor. Comput. Sci. 256(1-2): 3-21 (2001) |
| 2000 |
|---|
| 19 | | Yoram Hirshfeld,
Faron Moller:
On the star height of unary regular behaviours.
Proof, Language, and Interaction 2000: 497-510 |
| 1999 |
|---|
| 18 | | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
Quantitative Temporal Logic.
CSL 1999: 172-187 |
| 17 | EE | Yoram Hirshfeld,
Mark Jerrum:
Bisimulation Equivanlence Is Decidable for Normed Process Algebra.
ICALP 1999: 412-421 |
| 16 | EE | Yoram Hirshfeld,
Alexander Moshe Rabinovich:
A Framework for Decidable Metrical Logics.
ICALP 1999: 422-432 |
| 1996 |
|---|
| 15 | EE | Yoram Hirshfeld:
Bisimulation trees and the decidability of weak bisimulations.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
| 14 | | Yoram Hirshfeld:
Undecidability of Language Equivalence for Generalized Regular Expressions.
Fundam. Inform. 26(1): 95-102 (1996) |
| 13 | | 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) |
| 12 | EE | 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 |
|---|
| 11 | | Yoram Hirshfeld,
Faron Moller:
Decidability Results in Automata and Process Theory.
Banff Higher Order Workshop 1995: 102-148 |
| 1994 |
|---|
| 10 | | Yoram Hirshfeld,
Faron Moller:
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes.
CONCUR 1994: 48-63 |
| 9 | | Yoram Hirshfeld,
Mark Jerrum,
Faron Moller:
A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
FOCS 1994: 623-631 |
| 8 | | Søren Christensen,
Yoram Hirshfeld,
Faron Moller:
Decidable Subsets of CCS.
Comput. J. 37(4): 233-242 (1994) |
| 1993 |
|---|
| 7 | | Søren Christensen,
Yoram Hirshfeld,
Faron Moller:
Bisimulation Equivalence is Decidable for Basic Parallel Processes.
CONCUR 1993: 143-157 |
| 6 | | Yoram Hirshfeld:
Petri Nets and the Equivalence Problem.
CSL 1993: 165-174 |
| 5 | | Søren Christensen,
Yoram Hirshfeld,
Faron Moller:
Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes
LICS 1993: 386-396 |
| 1991 |
|---|
| 4 | | Yoram Hirshfeld:
Safe Queries in Relational Databases with Functions.
CSL 1991: 173-183 |
| 3 | | Arnon Avron,
Yoram Hirshfeld:
On First Order Database Query Languages
LICS 1991: 226-231 |
| 2 | | Yoram Hirshfeld:
Deterministic concurrent systems.
Fundam. Inform. 15(1): 13-36 (1991) |
| 1989 |
|---|
| 1 | | Yoram Hirshfeld,
Alexander Moshe Rabinovich,
Boris A. Trakhtenbrot:
Discerning Causality in Interleaving Behavior.
Logic at Botik 1989: 146-162 |
