On-line available Journal papers

• A. Rabinovich and B. A. Trakhtenbrot BEHAVIOR STRUCTURES AND NETS
  Fundamenta Informaticae XI (1988) 357-404
  
  
• A.Mazurkiewicz, A. Rabinovich and B.A. Trakhtenbrot
  Connectedness and Synchronization
  Theoretical Computer Science vol. 90 (1) pp. 171-184, 1991.
  
  
• A. Rabinovich
  Modularity and Expressibility for Nets of Relations
  In ACTA INFORMATICA 35 (1998), 293-327.
  
  
• A. Rabinovich
  On Schematological Equivalence of Dataflow Networks
  Journal of Information and Computation vol. 124 (2) pp.154-167, 1996.
  
  
• A. Rabinovich
  On Schematological Equivalence of Partially Interpreted Dataflow Networks
  Journal of Information and Computation vol. 138 (1) pp.49-88, 1997.
  
  
• A. Rabinovich
  On Translation of Temporal Logic of Actions into Monadic Second Order Logic
  Theoretical Computer Science, 193 (1998), 197-214
  
  
• A. Rabinovich
  Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
  Journal of Information and Computation vol. 139 pp.111-129, 1997.
  
  
• A. Rabinovich
  On the Decidability of Continuous Time Specification Formalisms
  Journal of Logic and Computation, vol 8, pp 669-678.
  
  
• A. Rabinovich
  Star Free Expressions over the Reals
  Theoretical Computer Science, Vol. 233, pp 233-245, 2000.
  
  
• A. Rabinovich
  Nonelementary Lower Bound for Propositional Duration Calculus
  In Information Processing Letters 66 (1998), 7-11.
  
  
• A. Rabinovich
  Succinctness Gap between Monadic Logic and Duration Calculus
  Fundamenta Informaticae, Vol. 42, pp. 1-10, 2000
  
  
• Y. Gurevich and A. Rabinovich
  Definability and Undefinability with Real Order at the Background.
  Journal of Symbolic Logic, Vol. 65(2):946-958, 2000.
  
  
• A. Rabinovich
  Symbolic Model Checking for $\mu$-calculus Requires Exponential Time.
  Theoretical Computer Science, vol. 243/1-2, pp. 467-475, 2000.
  
  
• A. Rabinovich
  Expressive Completeness of Duration Calculus.
  Information and Computation. Vol. 156, No. 1/2, pp. 320-344, 2000.
  
  
• A. Rabinovich and S. Maoz An Infinite Hierarchy of Temporal Logics over Branching Time.
  Information and Computation, 171:306-332, 2001.
  
  
• Y. Abramson and A. Rabinovich Decidability of split equivalence.
  Information and Computation, Vol. 173, No. 1, Feb 2002, pp. 15-39.
  
  
• Y. Gurevich and A. Rabinovich
  Definability in Rationals with Real Order in the Background.
  Journal of Logic and Computation, 12:1 (2002), pp. 1-11.
  
  
• A. Rabinovich
  Finite variability interpretation of monadic logic of order.
  Theoretical Computer Science, 275(1-2): 111-125 (2002).
  
  
• A. R. Meyer and A. Rabinovich Valid Identity Problem for Shuffle Regular Expressions.
  Journal of Automata Languages and Combinatorics 7 (2002) 1, 109-125.
  
  
• D. Beauquier and A. Rabinovich Monadic Logic of Order over Naturals Has no Finite Base.
  Invited paper for the special issue of Journal on Logic and Computations {12}:(2) pp 243-253, 2002.
  
  
• F. Moller and A. Rabinovich Counting on CTL*: on the expressive power of monadic path logic.
  Information and Computation 184(2003)147-159.
  
  
• Y. Hirshfeld and A. Rabinovich
  Future temporal logic needs infinitely many modalities
  Information and Computation 187(2): 196-208 (2003).
  
  
• A. Rabinovich
  Automata over Continuous Time
  In Theoretical Computer Science 300(2003)331-363.
  
  
• A. Rabinovich
  Selection and Uniformization in Generalized Product
  Logic J. of IGPL, 12:125-134,2004.
  
  
• A. Rabinovich
  On Compositionality and its Limitations
  ACM Transactions on Computational Logic, To appear.
  
  
• D. Pardo, A. Rabinovich and B. Trakhtembrot
  Synchronous Circuits over Continuous Time: Feedback Reliability and Completeness
  Fundamenta Informaticae, vol 62(1), pp. 123-137, 2004.
  
  
• Y. Hirshfeld and A. Rabinovich
  Logics for Real Time: Decidability and Complexity
  Fundamenta Informaticae, vol 62(1), pp. 1-28, 2004.
  
  
• Y. Hirshfeld and A. Rabinovich
  Timer formulas and decidable metric temporal logic.
  Information and Computation Vol 198(2), pp. 148-178, 2005.
  
  
• P. A. Abdulla, N. Bertrand, A. Rabinovich and Ph. Schnoebelen.
  Verification of Probabilistic Systems with Faulty Communication.
  Information and Computation Vol 202(2), pp. 105-228, 2005.
  
  
• A. Rabinovich
  Quantitative Analysis of Probabilistic Lossy Channel Systems.
  Information and Computation Vol 204 (5) pp 713-740, 2006.
  
  
• D. Beauquier, A. Rabinovich and A. Slissenko
  A logic of probability with decidable model-checking.
  Journal of Logic and Computations 16(4):461-487, 2006.
  
  
• A. Rabinovich and Ph. Schnoebelen.
  BTL₂ and expressive completeness for ECTL⁺.
  Information and Computation Vol 204 (7) pp. 1023-1044, 2006.
  
  
• A. Rabinovich.
  On compositionality and its limitations.
  ACM Transactions on Computational Logic 8(1):1-25, 2007.
  
  
• A. Rabinovich.
  Temporal Logics with Incommensurable Distances are Undecidable
  Information and Computation 205:707-715, 2007.
  
  
• Y. Hirshfeld and A. Rabinovich
  Expressiveness of Metric modalities for continuous time.
  Logical Methods in Computer Science, Vol. 3 (1:3):1-11, 2007, DOI: 10.2168/LMCS-3(1:3)2007.
  
  
• A. Rabinovich
  Composition Theorem for Generalized Sum
  Fundamenta Informaticae, 79(1-2):137-167, 2007.
  
  
• A. Rabinovich.
  On decidability of monadic logic of order over the naturals extended by monadic predicates.
  Information and Computation 205(6):870-889, 2007.
  
  
• G. Yorsh, A.Rabinovich, M. Sagiv, A. Meyer, A. Bouajjani.
  A Logic of Reachable Patterns in Linked Data-Structures.
  Special issue of Journal of Logic and Algebraic Programming 73(1-2):111-142, 2007.
  
  
• A. Rabinovich.
  Church Synthesis Problem with Parameters.
  Logical Methods in Computer Science, Vol. 3 (4:9):1-24, 2007, DOI: 10.2168/LMCS-3(4:9)2007.
  
  
• A. Rabinovich and A. Shomrat.
  Selection in Monadic Theory of a countable ordinal.
  Journal of Symbolic Logic 73(3), pp. 783-816, 2008.
• A. Rabinovich..
  Arity Hierarchy for Temporal Logics.
  Theoretical Computer Science 403 (2008), pp. 373-381.
• A. Rabinovich..
  The Church Problem for Countable Ordinals..
  Logical Methods in Computer Science 5(2),DOI: 10.2168/LMCS-5(2:5)2009.
• Y. Hirshfeld and A. Rabinovich.
  Decidable Metric Logics.
  Information and Computation 206 (2008), pp. 1425-1442.
• A. Abadi, A. Rabinovich and M. Sagiv..
  Decidable Fragments of Many-Sorted Logic.
  Journal of Symbolic Computation, Special Issue on Automated Deduction on Decidability, Complexity, Tractability,
  Volume 45, Issue 2, February 2010, Pages 153-172.
• A. Rabinovich and A. Shomrat.
  Selection over classes of ordinals expanded by monadic predicates.
  Annals of Pure and Applied Logic 161 (2010):1006-1023.
• M. Bojanczyk, D. Niwinski, A. Rabinovich, A. Radziwonczyk-Syta, M. Skrzypczak.
  On the Borel Complexity of MSO Definable Sets of Branches.
  Fundamenta Informaticae 98(4):337-349, 2010.
• M. Hirvensalo, J. Karhumaki and A. Rabinovich.
  Computing Partial Information out of Intractable: Powers of Algebraic Numbers as an Example.
  Journal of Number Theory, Volume 130, Issue 2, February 2010, pp. 232-253.
• A. Rabinovich.
  Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities.
  Theoretical Computer Science, 411 (2010):2331-2342.
• V. Barany, L. Kaiser and A. Rabinovich.
  Expressing cardinality quantifiers in monadic second-order logic over trees.
  Fundamentae Informaticae, 100 (2010) 1-18.
• A. Rabinovich.
  The full binary tree cannot be interpreted in a chain.
  Journal of Symbolic Logic, 75(4):1489-1498, 2010. Journal of Symbolic Logic, 75(4):1489-1498, 2010.
• S. Demri and A. Rabinovich.
  The complexity of temporal logic with Until and Since over the class of ordinals.
  Logical Methods in Computer Scienceú Volume 6, ISSUE 4, 2010
• A. Bes and A. Rabinovich.
  Decidable Expansions of Labelled Linear Orderings
  Volume 7, ISSUE 2, 2011. Logical Methods in Computer Science.
• Barany, L. Kaiser and A. Rabinovich.
  Expressing cardinality quantifiers in monadic second-order logic over chains.
  Journal of Symbolic Logic, 76(2): 603-619 (2011).
• A. Bes and A. Rabinovich.
  On Countable Chains Having Decidable Monadic Theory.
  J. Symb. Log. 77(2): 593-608 (2012).
• A. Rabinovich.
  Temporal logics over linear time domains are in PSPACE.
  Inf. Comput. 210: 40-67 (2012).
• Yoram Hirshfeld, Alexander Rabinovich.
  Continuous time temporal logic with counting.
  Inf. Comput. 214: 1-9 (2012)
• A. Rabinovich.
  The Church problem for expansions of (N, <) by unary predicates.
  Inf. Comput. 218: 1-16 (2012)
• A. Rabinovich
  A Proof of Kamp's theorem.
  Logical Methods in Computer Science 10(1) (2014)
• Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin
  The complexity of multi-mean-payoff and multi-energy games.
  Inf. Comput. 241: 177-196 (2015)
• Dorit Pardo, Alexander Rabinovich
  No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic.
  Inf. Comput. 247: 203-216 (2016)
• Alexander Rabinovich
  A Proof of Stavi's theorem.
  Logical Methods in Computer Science 14(1) (2018)
• Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
  Some complexity results for stateful network verification.
  Formal Methods in System Design 54(2): 191-231 (2019)
• Alexander Rabinovich, Doron Tiferet
  On Degrees of Ambiguity for Buchi Tree Automata.
  Inf. Comput. share link vol. 281, 2021
  
• Alexander Rabinovich, Doron Tiferet
  Ambiguity Hierarchy of Regular Infinite Tree Languages.
  ln Logical Methods in Computer Science, August 13, 2021, Volume 17, Issue 3 - https://doi.org/10.46298/lmcs-17(3:18)2021
• Boris Abramovich Trakhtenbrot: 100 birthday
  In Uspechi mathmmatccal Sciences, 77:1(463) (2022), 191–195, DOI: https://doi.org/10.4213/rm10048
.