|
Search the dblp DataBase
Yoram Hirshfeld:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Arnon Avron, Yoram Hirshfeld
On First Order Database Query Languages [Citation Graph (2, 0)][DBLP] LICS, 1991, pp:226-231 [Conf]
- Yoram Hirshfeld
Safe Queries in Relational Databases with Functions. [Citation Graph (1, 0)][DBLP] CSL, 1991, pp:173-183 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- Yoram Hirshfeld, Alexander Moshe Rabinovich
Quantitative Temporal Logic. [Citation Graph (0, 0)][DBLP] CSL, 1999, pp:172-187 [Conf]
- Yoram Hirshfeld
Petri Nets and the Equivalence Problem. [Citation Graph (0, 0)][DBLP] CSL, 1993, pp:165-174 [Conf]
- Yoram Hirshfeld, Alexander Moshe Rabinovich
Expressiveness of Metric Modalities for Continuous Time. [Citation Graph (0, 0)][DBLP] CSR, 2006, pp:211-220 [Conf]
- 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]
- 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]
- Yoram Hirshfeld, Mark Jerrum
Bisimulation Equivanlence Is Decidable for Normed Process Algebra. [Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:412-421 [Conf]
- Yoram Hirshfeld, Alexander Moshe Rabinovich
A Framework for Decidable Metrical Logics. [Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:422-432 [Conf]
- 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]
- Yoram Hirshfeld, Alexander Moshe Rabinovich
An Expressive Temporal Logic for Real Time. [Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:492-504 [Conf]
- 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]
- 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]
- Yoram Hirshfeld
Deterministic concurrent systems. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1991, v:15, n:1, pp:13-36 [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Yoram Hirshfeld, Alexander Rabinovich
Expressiveness of Metric modalities for continuous time [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Promptness in omega-Regular Automata. [Citation Graph (, )][DBLP]
On the star height of unary regular behaviours. [Citation Graph (, )][DBLP]
Fields, Meadows and Abstract Data Types. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
|