Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alexander Moshe Rabinovich
Alexander Rabinovich
2010 – today
- 2012
[j60]Alexander Rabinovich: Temporal logics over linear time domains are in PSPACE. Inf. Comput. 210: 40-67 (2012)- [j59]Yoram Hirshfeld, Alexander Rabinovich: Continuous time temporal logic with counting. Inf. Comput. 214: 1-9 (2012)
- [j58]Alexander Rabinovich: The Church problem for expansions of (N, <) by unary predicates. Inf. Comput. 218: 1-16 (2012)
- [j57]Alexis Bès, Alexander Rabinovich: On countable chains having decidable monadic theory. J. Symb. Log. 77(2): 593-608 (2012)
- [c46]
- [c45]Alexander Rabinovich, Sasha Rubin: Interpretations in Trees with Countably Many Branches. LICS 2012: 551-560
- [c44]Dorit Pardo Ordentlich, Alexander Rabinovich: A Finite Basis for 'Almost Future' Temporal Logic over the Reals. MFCS 2012: 740-751
- [i4]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin: The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012)
- 2011
- [j56]Alexis Bès, Alexander Rabinovich: Decidable Expansions of Labelled Linear Orderings. Logical Methods in Computer Science 7(2) (2011)
- [j55]Vince Bárány, Lukasz Kaiser, Alexander Rabinovich: Expressing cardinality quantifiers in monadic second-order logic over chains. J. Symb. Log. 76(2): 603-619 (2011)
- [c43]Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321
- [c42]
- 2010
- [j54]Alexander Rabinovich, Amit Shomrat: Selection over classes of ordinals expanded by monadic predicates. Ann. Pure Appl. Logic 161(8): 1006-1023 (2010)
- [j53]Stéphane Demri, Alexander Rabinovich: The complexity of linear-time temporal logic over the class of ordinals. Logical Methods in Computer Science 6(4) (2010)
- [j52]Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak: On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Inform. 98(4): 337-349 (2010)
- [j51]Vince Bárány, Lukasz Kaiser, Alexander Moshe Rabinovich: Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees. Fundam. Inform. 100(1-4): 1-17 (2010)
- [j50]Aharon Abadi, Alexander Rabinovich, Mooly Sagiv: Decidable fragments of many-sorted logic. J. Symb. Comput. 45(2): 153-172 (2010)
- [j49]Alexander Rabinovich: The full binary tree cannot be interpreted in a chain. J. Symb. Log. 75(4): 1489-1498 (2010)
- [j48]Alexander Rabinovich: Complexity of metric temporal logics with counting and the Pnueli modalities. Theor. Comput. Sci. 411(22-24): 2331-2342 (2010)
- [c41]Alexis Bès, Alexander Rabinovich: Decidable Expansions of Labelled Linear Orderings. Fields of Logic and Computation 2010: 95-107
- [c40]Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69
- [c39]
2000 – 2009
- 2009
- [j47]Alexander Rabinovich: The Church Problem for Countable Ordinals. Logical Methods in Computer Science 5(2) (2009)
- [c38]
- [c37]Vince Bárány, Lukasz Kaiser, Alexander Rabinovich: Cardinality Quantifiers in MLO over Trees. CSL 2009: 117-131
- [c36]
- [c35]Alexander Rabinovich: Synthesis of Finite-state and Definable Winning Strategies. FSTTCS 2009: 359-370
- 2008
- [j46]Yoram Hirshfeld, Alexander Moshe Rabinovich: Decidable metric logics. Inf. Comput. 206(12): 1425-1442 (2008)
- [j45]Alexander Rabinovich, Amit Shomrat: Selection in the monadic theory of a countable ordinal. J. Symb. Log. 73(3): 783-816 (2008)
- [j44]Alexander Rabinovich: Arity hierarchy for temporal logics. Theor. Comput. Sci. 403(2-3): 373-381 (2008)
- [c34]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich: Boris A. Trakhtenbrot: Academic Genealogy and Publications. Pillars of Computer Science 2008: 46-57
- [c33]Alexander Rabinovich, Amit Shomrat: Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. Pillars of Computer Science 2008: 571-588
- [c32]Alexander Rabinovich: Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. FORMATS 2008: 93-108
- [e1]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich (Eds.): Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Lecture Notes in Computer Science 4800, Springer 2008, ISBN 978-3-540-78126-4
- 2007
- [j43]Alexander Rabinovich: Composition Theorem for Generalized Sum. Fundam. Inform. 79(1-2): 137-167 (2007)
- [j42]Alexander Rabinovich: Temporal logics with incommensurable distances are undecidable. Inf. Comput. 205(5): 707-715 (2007)
- [j41]Alexander Rabinovich: On decidability of monadic logic of order over the naturals extended by monadic predicates. Inf. Comput. 205(6): 870-889 (2007)
- [j40]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A logic of reachable patterns in linked data-structures. J. Log. Algebr. Program. 73(1-2): 111-142 (2007)
- [j39]Yoram Hirshfeld, Alexander Rabinovich: Expressiveness of Metric modalities for continuous time. Logical Methods in Computer Science 3(1) (2007)
- [j38]Alexander Rabinovich: The Church Synthesis Problem with Parameters. Logical Methods in Computer Science 3(4) (2007)
- [j37]
- [c31]
- [c30]Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv: Decidable Fragments of Many-Sorted Logic. LPAR 2007: 17-31
- [c29]Stéphane Demri, Alexander Rabinovich: The Complexity of Temporal Logic with Until and Since over Ordinals. LPAR 2007: 531-545
- [i3]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A Logic of Reachable Patterns in Linked Data-Structures. CoRR abs/0705.3610 (2007)
- [i2]
- 2006
- [j36]Alexander Rabinovich: Quantitative analysis of probabilistic lossy channel systems. Inf. Comput. 204(5): 713-740 (2006)
- [j35]Alexander Rabinovich, Ph. Schnoebelen: BTL2 and the expressive power of ECTL+. Inf. Comput. 204(7): 1023-1044 (2006)
- [j34]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16(4): 461-487 (2006)
- [c28]
- [c27]Alexander Moshe Rabinovich, Wolfgang Thomas: Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. CSL 2006: 562-574
- [c26]Yoram Hirshfeld, Alexander Moshe Rabinovich: Expressiveness of Metric Modalities for Continuous Time. CSR 2006: 211-220
- [c25]
- [c24]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110
- [c23]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
- [j33]Alexander Moshe Rabinovich: Composition Theorems for Generalized Sum and Recursively Defined Types. Electr. Notes Theor. Comput. Sci. 123: 209-211 (2005)
- [j32]Yoram Hirshfeld, Alexander Moshe Rabinovich: Timer formulas and decidable metric temporal logic. Inf. Comput. 198(2): 148-178 (2005)
- [j31]Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005)
- 2004
- [j30]Yoram Hirshfeld, Alexander Moshe Rabinovich: Logics for Real Time: Decidability and Complexity. Fundam. Inform. 62(1): 1-28 (2004)
- [j29]D. Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. Fundam. Inform. 62(1): 123-137 (2004)
- [j28]Alexander Moshe Rabinovich: Selection and Uniformization in Generalized Product. Logic Journal of the IGPL 12(2): 125-134 (2004)
- [c22]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: Verification via Structure Simulation. CAV 2004: 281-294
- [c21]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL 2004: 160-174
- 2003
- [j27]Faron Moller, Alexander Moshe Rabinovich: Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1): 147-159 (2003)
- [j26]Yoram Hirshfeld, Alexander Moshe Rabinovich: Future temporal logic needs infinitely many modalities. Inf. Comput. 187(2): 196-208 (2003)
- [j25]Alexander Moshe Rabinovich: Automata over continuous time. Theor. Comput. Sci. 300(1-3): 331-363 (2003)
- [c20]Parosh Aziz Abdulla, Alexander Moshe Rabinovich: Verification of Probabilistic Systems with Faulty Communication. FoSSaCS 2003: 39-53
- [c19]Alexander Moshe Rabinovich: Quantitative Analysis of Probabilistic Lossy Channel Systems. ICALP 2003: 1008-1021
- 2002
- [j24]Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko: The Probability Nesting Game. Electr. Notes Theor. Comput. Sci. 68(2): 4-14 (2002)
- [j23]Y. Abramson, Alexander Moshe Rabinovich: Decidability of Split Equivalence. Inf. Comput. 173(1): 15-39 (2002)
- [j22]Albert R. Meyer, Alexander Moshe Rabinovich: Valid Identity Problem for Shuffle Regular Expressions. Journal of Automata, Languages and Combinatorics 7(1): 109-125 (2002)
- [j21]Yuri Gurevich, Alexander Moshe Rabinovich: Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002)
- [j20]Danièle Beauquier, Alexander Moshe Rabinovich: Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12(2): 243-253 (2002)
- [j19]Alexander Moshe Rabinovich: Finite variability interpretation of monadic logic of order. Theor. Comput. Sci. 275(1-2): 111-125 (2002)
- [c18]
- [c17]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model-Checking. CSL 2002: 306-321
- 2001
- [j18]Alexander Moshe Rabinovich, Shahar Maoz: An Infinite Hierarchy of Temporal Logics over Branching Time. Inf. Comput. 171(2): 306-332 (2001)
- 2000
- [j17]Alexander Moshe Rabinovich: Succinctness Gap between Monadic Logic and Duration Calculus. Fundam. Inform. 42(2): 201-210 (2000)
- [j16]Alexander Moshe Rabinovich: Expressive Completeness of Duration Calculus. Inf. Comput. 156(1-2): 320-344 (2000)
- [j15]Yuri Gurevich, Alexander Moshe Rabinovich: Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65(2): 946-958 (2000)
- [j14]Alexander Moshe Rabinovich: Star free expressions over the reals. Theor. Comput. Sci. 233(1-2): 233-245 (2000)
- [j13]Alexander Moshe Rabinovich: Symbolic model checking for µ-calculus requires exponential time. Theor. Comput. Sci. 243(1-2): 467-475 (2000)
- [c16]Alexander Moshe Rabinovich, Shahar Maoz: Why so Many Temporal Logics Climb up the Trees? MFCS 2000: 629-639
1990 – 1999
- 1999
- [c15]
- [c14]Yoram Hirshfeld, Alexander Moshe Rabinovich: A Framework for Decidable Metrical Logics. ICALP 1999: 422-432
- [c13]
- 1998
- [j12]Alexander Moshe Rabinovich: Modularity and Expressibility for Nets of Relations. Acta Inf. 35(4): 293-327 (1998)
- [j11]Alexander Moshe Rabinovich: Non-Elementary Lower Bound for Propositional Duration Calculus. Inf. Process. Lett. 66(1): 7-11 (1998)
- [j10]Alexander Moshe Rabinovich: On the Decidability of Continuous Time Specification Formalisms. J. Log. Comput. 8(5): 669-678 (1998)
- [j9]Alexander Moshe Rabinovich: On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. Theor. Comput. Sci. 193(1-2): 197-214 (1998)
- [c12]
- 1997
- [j8]Alexander Moshe Rabinovich: On expressive completeness of duration and mean value calculi. Electr. Notes Theor. Comput. Sci. 7: 248-261 (1997)
- [j7]Alexander Moshe Rabinovich: On Schematological Equivalence of Partially Interpreted Dataflow Networks. Inf. Comput. 138(1): 49-87 (1997)
- [j6]Alexander Moshe Rabinovich: Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. Inf. Comput. 139(2): 111-129 (1997)
- [c11]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: From Finite Automata toward Hybrid Systems (Extended Abstract). FCT 1997: 411-422
- 1996
- [j5]Alexander Moshe Rabinovich: On Schematological Equivalence of Dataflow Networks. Inf. Comput. 124(2): 154-167 (1996)
- 1995
- [j4]M. R. Best, Marat V. Burnashev, Y. Levy, Alexander Moshe Rabinovich, Peter C. Fishburn, A. Robert Calderbank, Daniel J. Costello Jr.: On a technique to calculate the exact performance of a convolutional code. IEEE Transactions on Information Theory 41(2): 441-447 (1995)
- [j3]A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich: Covering properties of convolutional codes and associated lattices. IEEE Transactions on Information Theory 41(3): 732-746 (1995)
- 1993
- [c10]A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich: Sequence Based Methods for Data Transmission and Source Compression. AAECC 1993: 1-12
- [c9]Alexander Moshe Rabinovich: A Complete Axiomatisation for Trace Congruence of Finite State Behaviors. MFPS 1993: 530-543
- 1992
- [c8]
- [c7]Alexander Moshe Rabinovich: Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). ICALP 1992: 696-707
- [c6]Alexander Moshe Rabinovich: Non Modularity and Expressibility for Nets of Relations. LFCS 1992: 394-405
- 1991
- [j2]Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Connectedness and Synchronization. Theor. Comput. Sci. 90(1): 171-184 (1991)
- [c5]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: On Nets, Algebras and Modularity. TACS 1991: 176-203
- 1990
- [c4]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Communication among Relations (Extended Abstract). ICALP 1990: 294-307
1980 – 1989
- 1989
- [c3]Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Discerning Causality in Interleaving Behavior. Logic at Botik 1989: 146-162
- [c2]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Nets and Data Flow Interpreters. LICS 1989: 164-174
- 1988
- [c1]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Nets of processes and data flow. REX Workshop 1988: 574-602
- 1987
- [j1]Alexander Moshe Rabinovich: Pomset semantics is consistenct with data flow semantics. Bulletin of the EATCS 32: 107-117 (1987)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:02 CET by the dblp team