Yoram Hirshfeld

According to our database, Yoram Hirshfeld authored at least 35 papers between 1988 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Continuous time temporal logic with counting.

Yoram Hirshfeld, Alexander Rabinovich

Inf. Comput., 2012

2010

Promptness in <i>omega</i>-Regular Automata.

Shaull Almagor, Yoram Hirshfeld, Orna Kupferman

Proceedings of the Automated Technology for Verification and Analysis, 2010

2009

Meadows and the equational specification of division.

Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker

Theor. Comput. Sci., 2009

2008

Decidable metric logics.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Inf. Comput., 2008

Fields, Meadows and Abstract Data Types.

Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker

Proceedings of the Pillars of Computer Science, 2008

2007

Expressiveness of Metric modalities for continuous time.

Yoram Hirshfeld, Alexander Rabinovich

Log. Methods Comput. Sci., 2007

2006

Abstraction classes in software design.

Amnon H. Eden, Yoram Hirshfeld, Rick Kazman

IEE Proc. Softw., 2006

An Expressive Temporal Logic for Real Time.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

Timer formulas and decidable metric temporal logic.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Inf. Comput., 2005

2004

Logics for Real Time: Decidability and Complexity.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Fundam. Informaticae, 2004

2003

Future temporal logic needs infinitely many modalities.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Inf. Comput., 2003

2002

The Probability Nesting Game.

Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

2001

Pushdown automata, multiset automata, and Petri nets.

Yoram Hirshfeld, Faron Moller

Theor. Comput. Sci., 2001

Principles in formal specification of object oriented design and architecture.

Amnon H. Eden, Yoram Hirshfeld

Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative Research, 2001

2000

On the star height of unary regular behaviours.

Yoram Hirshfeld, Faron Moller

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

A Framework for Decidable Metrical Logics.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Proceedings of the Automata, 1999

Bisimulation Equivanlence Is Decidable for Normed Process Algebra.

Yoram Hirshfeld, Mark Jerrum

Proceedings of the Automata, 1999

Quantitative Temporal Logic.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1996

A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes.

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Theor. Comput. Sci., 1996

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes.

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Math. Struct. Comput. Sci., 1996

Undecidability of Language Equivalence for Generalized Regular Expressions.

Yoram Hirshfeld

Fundam. Informaticae, 1996

Bisimulation trees and the decidability of weak bisimulations.

Yoram Hirshfeld

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

1995

Decidability Results in Automata and Process Theory.

Yoram Hirshfeld, Faron Moller

Proceedings of the Logics for Concurrency, 1995

1994

Queries evaluation, relative safety, and domain independence in first-order database languages with functions.

Arnon Avron, Yoram Hirshfeld

Methods Log. Comput. Sci., 1994

Decidable Subsets of CCS.

Søren Christensen, Yoram Hirshfeld, Faron Moller

Comput. J., 1994

A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes.

Yoram Hirshfeld, Faron Moller

Proceedings of the CONCUR '94, 1994

1993

Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes

Søren Christensen, Yoram Hirshfeld, Faron Moller

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Petri Nets and the Equivalence Problem.

Yoram Hirshfeld

Proceedings of the Computer Science Logic, 7th Workshop, 1993

Bisimulation Equivalence is Decidable for Basic Parallel Processes.

Søren Christensen, Yoram Hirshfeld, Faron Moller

Proceedings of the CONCUR '93, 1993

1991

Deterministic concurrent systems.

Yoram Hirshfeld

Fundam. Informaticae, 1991

On First Order Database Query Languages

Arnon Avron, Yoram Hirshfeld

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Safe Queries in Relational Databases with Functions.

Yoram Hirshfeld

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1989

Discerning Causality in Interleaving Behavior.

Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Logic at Botik '89, 1989

1988

Nonstandard combinatorics.

Joram Hirshfeld

Stud Logica, 1988