Alexander Moshe Rabinovich

Alexander Rabinovich

	2012
106		Alexander Rabinovich: Temporal logics over linear time domains are in PSPACE. Inf. Comput. 210: 40-67 (2012)
105		Yoram Hirshfeld, Alexander Rabinovich: Continuous time temporal logic with counting. Inf. Comput. 214: 1-9 (2012)
104		Alexis Bès, Alexander Rabinovich: On countable chains having decidable monadic theory. J. Symb. Log. 77(2): 593-608 (2012)
	2011
103		Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321
102		Yaron Velner, Alexander Rabinovich: Church Synthesis Problem for Noisy Input. FOSSACS 2011: 275-289
101		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)
100		Alexis Bès, Alexander Rabinovich: Decidable Expansions of Labelled Linear Orderings Logical Methods in Computer Science 7(2): (2011)
	2010
99		Alexis Bès, Alexander Rabinovich: Decidable Expansions of Labelled Linear Orderings. Fields of Logic and Computation 2010: 95-107
98		Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69
97		Alexander Rabinovich: Temporal Logics over Linear Time Domains Are in PSPACE. RP 2010: 29-50
96		Alexander Rabinovich, Amit Shomrat: Selection over classes of ordinals expanded by monadic predicates. Ann. Pure Appl. Logic 161(8): 1006-1023 (2010)
95		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)
94		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)
93		Aharon Abadi, Alexander Rabinovich, Mooly Sagiv: Decidable fragments of many-sorted logic. J. Symb. Comput. 45(2): 153-172 (2010)
92		Alexander Rabinovich: The full binary tree cannot be interpreted in a chain. J. Symb. Log. 75(4): 1489-1498 (2010)
91		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)
90		Alexander Rabinovich: Complexity of metric temporal logics with counting and the Pnueli modalities. Theor. Comput. Sci. 411(22-24): 2331-2342 (2010)
	2009
89		Joël Ouaknine, Alexander Rabinovich, James Worrell: Time-Bounded Verification. CONCUR 2009: 496-510
88		Vince Bárány, Lukasz Kaiser, Alexander Rabinovich: Cardinality Quantifiers in MLO over Trees. CSL 2009: 117-131
87		Alexander Rabinovich: Decidable Extensions of Church's Problem. CSL 2009: 424-439
86		Alexander Rabinovich: Synthesis of Finite-state and Definable Winning Strategies. FSTTCS 2009: 359-370
85		Alexander Rabinovich: The Church Problem for Countable Ordinals Logical Methods in Computer Science 5(2): (2009)
	2008
84		Arnon Avron, Nachum Dershowitz, Alexander Rabinovich: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday Springer 2008
83		Alexander Rabinovich: Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. FORMATS 2008: 93-108
82		Arnon Avron, Nachum Dershowitz, Alexander Rabinovich: Boris A. Trakhtenbrot: Academic Genealogy and Publications. Pillars of Computer Science 2008: 46-57
81		Alexander Rabinovich, Amit Shomrat: Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. Pillars of Computer Science 2008: 571-588
80		Yoram Hirshfeld, Alexander Moshe Rabinovich: Decidable metric logics. Inf. Comput. 206(12): 1425-1442 (2008)
79		Alexander Rabinovich, Amit Shomrat: Selection in the monadic theory of a countable ordinal. J. Symb. Log. 73(3): 783-816 (2008)
78		Alexander Rabinovich: Arity hierarchy for temporal logics. Theor. Comput. Sci. 403(2-3): 373-381 (2008)
	2007
77		Alexander Rabinovich, Wolfgang Thomas: Logical Refinements of Church's Problem. CSL 2007: 69-83
76		Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv: Decidable Fragments of Many-Sorted Logic. LPAR 2007: 17-31
75		Stéphane Demri, Alexander Rabinovich: The Complexity of Temporal Logic with Until and Since over Ordinals. LPAR 2007: 531-545
74		Alexander Rabinovich: On compositionality and its limitations. ACM Trans. Comput. Log. 8(1): (2007)
73		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)
72		Alexander Rabinovich: The Church Synthesis Problem with Parameters CoRR abs/0708.3477: (2007)
71		Alexander Rabinovich: Composition Theorem for Generalized Sum. Fundam. Inform. 79(1-2): 137-167 (2007)
70		Alexander Rabinovich: Temporal logics with incommensurable distances are undecidable. Inf. Comput. 205(5): 707-715 (2007)
69		Alexander Rabinovich: On decidability of monadic logic of order over the naturals extended by monadic predicates. Inf. Comput. 205(6): 870-889 (2007)
68		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)
67		Yoram Hirshfeld, Alexander Rabinovich: Expressiveness of Metric modalities for continuous time. Logical Methods in Computer Science 3(1): (2007)
66		Alexander Rabinovich: The Church Synthesis Problem with Parameters. Logical Methods in Computer Science 3(4): (2007)
	2006
65		Alexander Moshe Rabinovich: Church Synthesis Problem with Parameters. CSL 2006: 546-561
64		Alexander Moshe Rabinovich, Wolfgang Thomas: Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. CSL 2006: 562-574
63		Yoram Hirshfeld, Alexander Moshe Rabinovich: Expressiveness of Metric Modalities for Continuous Time. CSR 2006: 211-220
62		Alexander Moshe Rabinovich: Decidability and Expressive Power of Real Time Logics. FORMATS 2006: 32
61		Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110
60		Yoram Hirshfeld, Alexander Moshe Rabinovich: An Expressive Temporal Logic for Real Time. MFCS 2006: 492-504
59		Yoram Hirshfeld, Alexander Rabinovich: Expressiveness of Metric modalities for continuous time CoRR abs/cs/0611119: (2006)
58		Alexander Rabinovich: Quantitative analysis of probabilistic lossy channel systems. Inf. Comput. 204(5): 713-740 (2006)
57		Alexander Rabinovich, Ph. Schnoebelen: BTL2 and the expressive power of ECTL+. Inf. Comput. 204(7): 1023-1044 (2006)
56		Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16(4): 461-487 (2006)
	2005
55		Alexander Moshe Rabinovich: Composition Theorems for Generalized Sum and Recursively Defined Types. Electr. Notes Theor. Comput. Sci. 123: 209-211 (2005)
54		Yoram Hirshfeld, Alexander Moshe Rabinovich: Timer formulas and decidable metric temporal logic. Inf. Comput. 198(2): 148-178 (2005)
53		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
52		Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: Verification via Structure Simulation. CAV 2004: 281-294
51		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
50		Yoram Hirshfeld, Alexander Moshe Rabinovich: Logics for Real Time: Decidability and Complexity. Fundam. Inform. 62(1): 1-28 (2004)
49		D. Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. Fundam. Inform. 62(1): 123-137 (2004)
48		Alexander Moshe Rabinovich: Selection and Uniformization in Generalized Product. Logic Journal of the IGPL 12(2): 125-134 (2004)
	2003
47		Parosh Aziz Abdulla, Alexander Moshe Rabinovich: Verification of Probabilistic Systems with Faulty Communication. FoSSaCS 2003: 39-53
46		Alexander Moshe Rabinovich: Quantitative Analysis of Probabilistic Lossy Channel Systems. ICALP 2003: 1008-1021
45		Faron Moller, Alexander Moshe Rabinovich: Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1): 147-159 (2003)
44		Yoram Hirshfeld, Alexander Moshe Rabinovich: Future temporal logic needs infinitely many modalities. Inf. Comput. 187(2): 196-208 (2003)
43		Alexander Moshe Rabinovich: Automata over continuous time. Theor. Comput. Sci. 300(1-3): 331-363 (2003)
	2002
42		Alexander Moshe Rabinovich: Expressive Power of Temporal Logics. CONCUR 2002: 57-75
41		Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model-Checking. CSL 2002: 306-321
40		Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko: The Probability Nesting Game. Electr. Notes Theor. Comput. Sci. 68(2): 4-14 (2002)
39		Y. Abramson, Alexander Moshe Rabinovich: Decidability of Split Equivalence. Inf. Comput. 173(1): 15-39 (2002)
38		Yuri Gurevich, Alexander Moshe Rabinovich: Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002)
37		Danièle Beauquier, Alexander Moshe Rabinovich: Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12(2): 243-253 (2002)
36		Albert R. Meyer, Alexander Moshe Rabinovich: Valid Identity Problem for Shuffle Regular Expressions. Journal of Automata, Languages and Combinatorics 7(1): 109-125 (2002)
35		Alexander Moshe Rabinovich: Finite variability interpretation of monadic logic of order. Theor. Comput. Sci. 275(1-2): 111-125 (2002)
	2001
34		Alexander Moshe Rabinovich, Shahar Maoz: An Infinite Hierarchy of Temporal Logics over Branching Time. Inf. Comput. 171(2): 306-332 (2001)
	2000
33		Alexander Moshe Rabinovich, Shahar Maoz: Why so Many Temporal Logics Climb up the Trees? MFCS 2000: 629-639
32		Alexander Moshe Rabinovich: Succinctness Gap between Monadic Logic and Duration Calculus. Fundam. Inform. 42(2): 201-210 (2000)
31		Alexander Moshe Rabinovich: Expressive Completeness of Duration Calculus. Inf. Comput. 156(1-2): 320-344 (2000)
30		Yuri Gurevich, Alexander Moshe Rabinovich: Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65(2): 946-958 (2000)
29		Alexander Moshe Rabinovich: Star free expressions over the reals. Theor. Comput. Sci. 233(1-2): 233-245 (2000)
28		Alexander Moshe Rabinovich: Symbolic model checking for µ-calculus requires exponential time. Theor. Comput. Sci. 243(1-2): 467-475 (2000)
	1999
27		Yoram Hirshfeld, Alexander Moshe Rabinovich: Quantitative Temporal Logic. CSL 1999: 172-187
26		Yoram Hirshfeld, Alexander Moshe Rabinovich: A Framework for Decidable Metrical Logics. ICALP 1999: 422-432
25		Faron Moller, Alexander Moshe Rabinovich: On the Expressive Power of CTL. LICS 1999: 360-368
	1998
24		Alexander Moshe Rabinovich: Expressive Completeness of Temporal Logic of Action. MFCS 1998: 229-238
23		Alexander Moshe Rabinovich: Modularity and Expressibility for Nets of Relations. Acta Inf. 35(4): 293-327 (1998)
22		Alexander Moshe Rabinovich: Non-Elementary Lower Bound for Propositional Duration Calculus. Inf. Process. Lett. 66(1): 7-11 (1998)
21		Alexander Moshe Rabinovich: On the Decidability of Continuous Time Specification Formalisms. J. Log. Comput. 8(5): 669-678 (1998)
20		Alexander Moshe Rabinovich: On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. Theor. Comput. Sci. 193(1-2): 197-214 (1998)
	1997
19		Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: From Finite Automata toward Hybrid Systems (Extended Abstract). FCT 1997: 411-422
18		Alexander Moshe Rabinovich: On expressive completeness of duration and mean value calculi. Electr. Notes Theor. Comput. Sci. 7: 248-261 (1997)
17		Alexander Moshe Rabinovich: On Schematological Equivalence of Partially Interpreted Dataflow Networks. Inf. Comput. 138(1): 49-87 (1997)
16		Alexander Moshe Rabinovich: Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. Inf. Comput. 139(2): 111-129 (1997)
	1996
15		Alexander Moshe Rabinovich: On Schematological Equivalence of Dataflow Networks. Inf. Comput. 124(2): 154-167 (1996)
	1995
14		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)
13		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
12		A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich: Sequence Based Methods for Data Transmission and Source Compression. AAECC 1993: 1-12
11		Alexander Moshe Rabinovich: A Complete Axiomatisation for Trace Congruence of Finite State Behaviors. MFPS 1993: 530-543
	1992
10		Alexander Moshe Rabinovich: Logic of Trace Languages (Extended Abstract). CONCUR 1992: 504-517
9		Alexander Moshe Rabinovich: Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). ICALP 1992: 696-707
8		Alexander Moshe Rabinovich: Non Modularity and Expressibility for Nets of Relations. LFCS 1992: 394-405
	1991
7		Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: On Nets, Algebras and Modularity. TACS 1991: 176-203
6		Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Connectedness and Synchronization. Theor. Comput. Sci. 90(1): 171-184 (1991)
	1990
5		Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Communication among Relations (Extended Abstract). ICALP 1990: 294-307
	1989
4		Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Nets and Data Flow Interpreters LICS 1989: 164-174
3		Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Discerning Causality in Interleaving Behavior. Logic at Botik 1989: 146-162
	1988
2		Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Nets of processes and data flow. REX Workshop 1988: 574-602
	1987
1		Alexander Moshe Rabinovich: Pomset semantics is consistenct with data flow semantics. Bulletin of the EATCS 32: 107-117 (1987)

Coauthor Index

1	Aharon Abadi	[76] [93]
2	Parosh Aziz Abdulla	[47] [53]
3	Y. Abramson	[39]
4	Arnon Avron	[82] [84]
5	Vince Bárány	[88] [95] [101]
6	Danièle Beauquier	[37] [40] [41] [56]
7	Nathalie Bertrand	[53]
8	Alexis Bès	[99] [100] [104]
9	M. R. Best	[14]
10	Mikolaj Bojanczyk	[94]
11	Ahmed Bouajjani	[61] [68] [73]
12	Marat V. Burnashev	[14]
13	A. Robert Calderbank	[12] [13] [14]
14	Daniel J. Costello Jr.	[14]
15	Stéphane Demri	[75] [91]
16	Nachum Dershowitz	[82] [84]
17	Peter C. Fishburn	[12] [13] [14]
18	Yuri Gurevich	[30] [38]
19	Yoram Hirshfeld	[3] [26] [27] [40] [44] [50] [54] [59] [60] [63] [67] [80] [105]
20	Neil Immerman	[51] [52]
21	Mark Jenkins	[98] [103]
22	Lukasz Kaiser	[88] [95] [101]
23	Y. Levy	[14]
24	Shahar Maoz	[33] [34]
25	Antoni W. Mazurkiewicz	[6]
26	Albert R. Meyer	[36]
27	Antoine Meyer	[61] [68] [73]
28	Faron Moller	[25] [45]
29	Damian Niwinski	[94]
30	Joël Ouaknine	[89] [98] [103]
31	D. Pardo	[49]
32	Adam Radziwonczyk-Syta	[94]
33	Thomas W. Reps	[51] [52]
34	Shmuel Sagiv (Mooly Sagiv)	[51] [52] [61] [68] [73] [76] [93]
35	Ph. Schnoebelen (Philippe Schnoebelen)	[53] [57]
36	Amit Shomrat	[79] [81] [96]
37	Michal Skrzypczak	[94]
38	Anatol Slissenko	[40] [41] [56]
39	Wolfgang Thomas	[64] [77]
40	Boris A. Trakhtenbrot	[2] [3] [4] [5] [6] [7] [19] [49]
41	Yaron Velner	[102]
42	James Worrell	[89] [98] [103]
43	Greta Yorsh	[51] [52] [61] [68] [73]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page