Research output per year
Research output per year
- 14 results
Search results
-
2012
Continuous time temporal logic with counting
Hirshfeld, Y. & Rabinovich, A., May 2012, In: Information and Computation. 214, p. 1-9 9 p.Research output: Contribution to journal › Article › peer-review
Open Access7 Scopus citations -
2009
Meadows and the equational specification of division
Bergstra, J. A., Hirshfeld, Y. & Tucker, J. V., 17 Mar 2009, In: Theoretical Computer Science. 410, 12-13, p. 1261-1271 11 p.Research output: Contribution to journal › Article › peer-review
Open Access22 Scopus citations -
2008
Decidable metric logics
Hirshfeld, Y. & Rabinovich, A., Dec 2008, In: Information and Computation. 206, 12, p. 1425-1442 18 p.Research output: Contribution to journal › Article › peer-review
Open Access3 Scopus citations -
2007
Expressiveness of metric modalities for continuous time
Hirshfeld, Y. & Rabinovich, A., 23 Feb 2007, In: Logical Methods in Computer Science. 3, 1, 3.Research output: Contribution to journal › Article › peer-review
Open Access23 Scopus citations -
2006
Abstraction classes in software design
Eden, A. H., Hirshfeld, Y. & Kazman, R., 2006, In: IEE Proceedings: Software. 153, 4, p. 163-182 20 p.Research output: Contribution to journal › Article › peer-review
16 Scopus citations -
2005
Timer formulas and decidable metric temporal logic
Hirshfeld, Y. & Rabinovich, A., 1 May 2005, In: Information and Computation. 198, 2, p. 148-178 31 p.Research output: Contribution to journal › Article › peer-review
Open Access22 Scopus citations -
2004
Logics for real time: Decidability and complexity
Hirshfeld, Y. & Rabinovich, A., Aug 2004, In: Fundamenta Informaticae. 62, 1, p. 1-28 28 p.Research output: Contribution to journal › Article › peer-review
80 Scopus citations -
2003
Future temporal logic needs infinitely many modalities
Hirshfeld, Y. & Rabinovich, A., 15 Dec 2003, In: Information and Computation. 187, 2, p. 196-208 13 p.Research output: Contribution to journal › Article › peer-review
Open Access10 Scopus citations -
2001
Pushdown automata, multiset automata, and Petri nets
Hirshfeld, Y. & Moller, F., 2001, In: Theoretical Computer Science. 256, 1-2, p. 3-21 19 p.Research output: Contribution to journal › Article › peer-review
Open Access9 Scopus citations -
1996
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Hirshfeld, Y., Jerrum, M. & Moller, F., 20 May 1996, In: Theoretical Computer Science. 158, 1-2, p. 143-159 17 p.Research output: Contribution to journal › Article › peer-review
Open Access103 Scopus citations -
A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes
Hirshfeld, Y., Jerrum, M. & Moller, F., 16 Jun 1996, In: Mathematical Structures in Computer Science. 6, 3, p. 251-259 9 p.Research output: Contribution to journal › Article › peer-review
59 Scopus citations -
1994
Decidable subsets of CCS
Christensen, S., Hirshfeld, Y. & Moller, F., 1994, In: Computer Journal. 37, 4, p. 233-242 10 p.Research output: Contribution to journal › Article › peer-review
19 Scopus citations -
Queries evaluation, relative safety, and domain independence in first-order database languages with functions
Avron, A. & Hirshfeld, J., 1994, In: Methods of logic in computer science. 1, 3, p. 261-277 17 p.Research output: Contribution to journal › Article › peer-review
-
1988
Nonstandard combinatorics
Hirshfeld, J., Sep 1988, In: Studia Logica. 47, 3, p. 221-232 12 p.Research output: Contribution to journal › Article › peer-review
6 Scopus citations