default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoram Hirshfeld
Person information
- affiliation: Tel Aviv University, School of Mathematical Sciences, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j16]Yoram Hirshfeld, Alexander Rabinovich
:
Continuous time temporal logic with counting. Inf. Comput. 214: 1-9 (2012)- 2010
- [c20]Shaull Almagor, Yoram Hirshfeld, Orna Kupferman:
Promptness in omega-Regular Automata. ATVA 2010: 22-36
2000 – 2009
- 2009
- [j15]Jan A. Bergstra, Yoram Hirshfeld, John 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) - [c19]Jan A. Bergstra, Yoram Hirshfeld, John V. 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. Log. Methods Comput. Sci. 3(1) (2007) - 2006
- [j12]Amnon H. Eden, Yoram Hirshfeld, Rick Kazman:
Abstraction classes in software design. IEE Proc. Softw. 153(4): 163-182 (2006) - [c18]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Expressiveness of Metric Modalities for Continuous Time. CSR 2006: 211-220 - [c17]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
- [j11]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Timer formulas and decidable metric temporal logic. Inf. Comput. 198(2): 148-178 (2005) - 2004
- [j10]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Logics for Real Time: Decidability and Complexity. Fundam. Informaticae 62(1): 1-28 (2004) - 2003
- [j9]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Future temporal logic needs infinitely many modalities. Inf. Comput. 187(2): 196-208 (2003) - 2002
- [c16]Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko:
The Probability Nesting Game. EXPRESS 2002: 4-14 - 2001
- [j8]Yoram Hirshfeld, Faron Moller:
Pushdown automata, multiset automata, and Petri nets. Theor. Comput. Sci. 256(1-2): 3-21 (2001) - [c15]Amnon H. Eden, Yoram Hirshfeld:
Principles in formal specification of object oriented design and architecture. CASCON 2001: 3 - 2000
- [c14]Yoram Hirshfeld, Faron Moller:
On the star height of unary regular behaviours. Proof, Language, and Interaction 2000: 497-510
1990 – 1999
- 1999
- [c13]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Quantitative Temporal Logic. CSL 1999: 172-187 - [c12]Yoram Hirshfeld, Mark Jerrum:
Bisimulation Equivanlence Is Decidable for Normed Process Algebra. ICALP 1999: 412-421 - [c11]Yoram Hirshfeld, Alexander Moshe Rabinovich:
A Framework for Decidable Metrical Logics. ICALP 1999: 422-432 - 1996
- [j7]Yoram Hirshfeld:
Undecidability of Language Equivalence for Generalized Regular Expressions. Fundam. Informaticae 26(1): 95-102 (1996) - [j6]Yoram Hirshfeld, Mark Jerrum, Faron Moller:
A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. Math. Struct. Comput. Sci. 6(3): 251-259 (1996) - [j5]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) - [c10]Yoram Hirshfeld:
Bisimulation trees and the decidability of weak bisimulations. INFINITY 1996: 2-13 - 1995
- [c9]Yoram Hirshfeld, Faron Moller:
Decidability Results in Automata and Process Theory. Banff Higher Order Workshop 1995: 102-148 - 1994
- [j4]Søren Christensen, Yoram Hirshfeld, Faron Moller:
Decidable Subsets of CCS. Comput. J. 37(4): 233-242 (1994) - [j3]Arnon Avron, Yoram Hirshfeld:
Queries evaluation, relative safety, and domain independence in first-order database languages with functions. Methods Log. Comput. Sci. 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]Yoram Hirshfeld:
Petri Nets and the Equivalence Problem. CSL 1993: 165-174 - [c4]Søren Christensen, Yoram Hirshfeld, Faron Moller:
Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes. LICS 1993: 386-396 - 1991
- [j2]Yoram Hirshfeld:
Deterministic concurrent systems. Fundam. Informaticae 15(1): 13-36 (1991) - [c3]Yoram Hirshfeld:
Safe Queries in Relational Databases with Functions. CSL 1991: 173-183 - [c2]Arnon Avron, Yoram Hirshfeld:
On First Order Database Query Languages. LICS 1991: 226-231
1980 – 1989
- 1989
- [c1]Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Discerning Causality in Interleaving Behavior. Logic at Botik 1989: 146-162 - 1988
- [j1]Joram Hirshfeld:
Nonstandard combinatorics. Stud Logica 47(3): 221-232 (1988)
Coauthor Index
aka: Alexander Rabinovich
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
