1988 …2023

Research activity per year

Search results

  • 1999

    A framework for decidable metrical logics

    Hirshfeld, Y. & Rabinovich, A., 1999, Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Springer Verlag, p. 422-432 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1644 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    22 Scopus citations
  • On the expressive power of CTL

    Moller, F. & Rabinovich, A., 1999, Proceedings - Symposium on Logic in Computer Science. IEEE, p. 360-368 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    37 Scopus citations
  • Quantitative temporal logic

    Hirshfeld, Y. & Rabinovich, A., 1999, Computer Science Logic - 13th International Workshop, CSL 1999 - 8th Annual Conference of the EACSL, Proceedings. Flum, J. & Rodriguez-Artalejo, M. (eds.). Springer Verlag, p. 172-187 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1683).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    28 Scopus citations
  • 1998

    Expressive completeness of temporal logic of action

    Rabinovich, A., 1998, Mathematical Foundations of Computer Science 1998 - 23rd International Symposium, MFCS 1998, Proceedings. Brim, L., Gruska, J. & Zlatuska, J. (eds.). Springer Verlag, p. 229-238 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1450 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    8 Scopus citations
  • Modularity and expressibility for nets of relations

    Rabinovich, A., Apr 1998, In: Acta Informatica. 35, 4, p. 293-327 35 p.

    Research output: Contribution to journalArticlepeer-review

    1 Scopus citations
  • Non-elementary lower bound for Propositional Duration Calculus

    Rabinovich, A., 15 Apr 1998, In: Information Processing Letters. 66, 1, p. 7-11 5 p.

    Research output: Contribution to journalArticlepeer-review

    8 Scopus citations
  • On the decidability of continuous time specification formalisms

    Rabinovich, A., Oct 1998, In: Journal of Logic and Computation. 8, 5, p. 669-678 10 p.

    Research output: Contribution to journalArticlepeer-review

    28 Scopus citations
  • On translations of temporal logic of actions into monadic second-order logic

    Rabinovich, A., 28 Feb 1998, In: Theoretical Computer Science. 193, 1-2, p. 197-214 18 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    9 Scopus citations
  • 1997

    Complexity of Equivalence Problems for Concurrent Systems of Finite Agents

    Rabinovich, A., 15 Dec 1997, In: Information and Computation. 139, 2, p. 111-129 19 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    22 Scopus citations
  • From finite automata toward hybrid systems

    Rabinovich, A. & Trakhtenbrot, B. A., 1997, Fundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings. Chlebus, B. S. & Czaja, L. (eds.). Springer Verlag, p. 411-422 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1279).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    10 Scopus citations
  • On expressive completeness of duration and mean value calculi (extended abstract)

    Rabinovich, A., 1997, In: Electronic Notes in Theoretical Computer Science. 7, p. 248-261 14 p.

    Research output: Contribution to journalConference articlepeer-review

    Open Access
    5 Scopus citations
  • On Schematological Equivalence of Partially Interpreted Dataflow Networks

    Rabinovich, A., 10 Oct 1997, In: Information and Computation. 138, 1, p. 49-87 39 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
  • 1996

    On Schematological Equivalence of Dataflow Networks

    Rabinovich, A., 1 Feb 1996, In: Information and Computation. 124, 2, p. 154-167 14 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    1 Scopus citations
  • 1994

    A complete axiomatisation for trace congruence of finite state behaviors

    Rabinovich, A., 1994, Mathematical Foundations of Programming Semantics - 9th International Conference, Proceedings. Brookes, S., Main, M., Melton, A., Mislove, M. & Schmidt, D. (eds.). Springer Verlag, p. 530-543 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 802 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    22 Scopus citations
  • 1992

    Checking equivalences between concurrent systems of finite agents

    Rabinovich, A., 1992, Automata, Languages and Programming - 19th International Colloquium, Proceedings. Kuich, W. (ed.). Springer Verlag, p. 696-707 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 623 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Scopus citations
  • Logic of trace languages

    Rabinovich, A., 1992, CONCUR 1992 - 3rd International Conference on Concurrency Theory, Proceedings. Cleaveland, W. R. (ed.). Springer Verlag, p. 504-517 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 630 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • Non modularity and expressibility for nets of relations

    Rabinovich, A., 1992, Logical Foundations of Computer Science — Tver 1992 - 2nd International Symposium, Proceedings. Nerode, A. & Taitslin, M. (eds.). Springer Verlag, p. 394-405 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 620 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 1991

    Connectedness and synchronization

    Mazurkiewicz, A., Rabinovich, A. & Trakhtenbrot, B. A., 11 Nov 1991, In: Theoretical Computer Science. 90, 1, p. 171-184 14 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    1 Scopus citations
  • On nets, algebras and modularity

    Rabinovich, A. & Trakhtenbrot, B. A., 1991, Theoretical Aspects of Computer Software - International Conference TACS 1991, Proceedings. Meyer, A. R. & Ito, T. (eds.). Springer Verlag, p. 176-203 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 526 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    8 Scopus citations
  • 1990

    Communication among relations

    Rabinovich, A. & Trakhtenbrot, B. A., 1990, Automata, Languages and Programming - l7th International Colloquium, Proceedings. Paterson, M. S. (ed.). Springer Verlag, p. 294-307 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 443 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Scopus citations
  • 1989

    Discerning causality in interleaving behavior

    Hirshfeld, J., Rabinovich, A. & Trakhtenbrot, B. A., 1989, Logic at Botik 1989 - Symposium on Logical Foundations of Computer Science, Proceedings. Meyer, A. R. & Taitslin, M. A. (eds.). Springer Verlag, p. 146-162 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 363 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Scopus citations
  • Nets and data flow interpreters

    Rabinovich, A. & Trakhtenbrot, B. A., 1989, Proc Fourth Ann Symp Logic Comput Sci. Anon (ed.). Publ by IEEE, p. 164-174 11 p. (Proc Fourth Ann Symp Logic Comput Sci).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Scopus citations
  • Nets of processes and data flow

    Rabinovich, A. & Trakhtenbrot, B. A., 1989, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency - School/Workshop. de Bakker, J. W., Rozenberg, G. & de Roever, W-P. (eds.). Springer Verlag, p. 574-602 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 354 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    10 Scopus citations
  • 1988

    Behavior structures and nets

    Rabinovich, A. & Trakhtenbrot, B. A., Dec 1988, In: Fundamenta Informaticae. 11, 4, p. 357-403 47 p.

    Research output: Contribution to journalArticlepeer-review

    119 Scopus citations