Alexander Moshe Rabinovich

Publication Activity (10 Years)

Years Active: 1987-2016
Publications (10 Years): 1

Top Topics

Dynamic Systems

Top Venues

Publications

Dorit Pardo, Alexander Moshe Rabinovich
No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic. Inf. Comput. 247 (2016)
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 (2015)
Vince Bárány, Lukasz Kaiser, Alexander Moshe Rabinovich
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees. Fundam. Informaticae 100 (1-4) (2010)
Yoram Hirshfeld, Alexander Moshe Rabinovich
Decidable metric logics. Inf. Comput. 206 (12) (2008)
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv
Decidable Fragments of Many-Sorted Logic. LPAR (2007)
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A logic of reachable patterns in linked data-structures. J. Log. Algebraic Methods Program. 73 (1-2) (2007)
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures CoRR (2007)
Alexander Moshe Rabinovich
Decidability and Expressive Power of Real Time Logics. FORMATS (2006)
Yoram Hirshfeld, Alexander Moshe Rabinovich
Expressiveness of Metric Modalities for Continuous Time. CSR (2006)
Alexander Moshe Rabinovich, Wolfgang Thomas
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. CSL (2006)
Alexander Moshe Rabinovich
Church Synthesis Problem with Parameters. CSL (2006)
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16 (4) (2006)
Yoram Hirshfeld, Alexander Moshe Rabinovich
An Expressive Temporal Logic for Real Time. MFCS (2006)
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS (2006)
Alexander Moshe Rabinovich
Composition Theorems for Generalized Sum and Recursively Defined Types. Electron. Notes Theor. Comput. Sci. 123 (2005)
Yoram Hirshfeld, Alexander Moshe Rabinovich
Timer formulas and decidable metric temporal logic. Inf. Comput. 198 (2) (2005)
Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen
Verification of probabilistic systems with faulty communication. Inf. Comput. 202 (2) (2005)
Alexander Moshe Rabinovich
Selection and Uniformization in Generalized Product. Log. J. IGPL 12 (2) (2004)
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL (2004)
Dorit Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. Fundam. Informaticae 62 (1) (2004)
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
Verification via Structure Simulation. CAV (2004)
Yoram Hirshfeld, Alexander Moshe Rabinovich
Logics for Real Time: Decidability and Complexity. Fundam. Informaticae 62 (1) (2004)
Alexander Moshe Rabinovich
Quantitative Analysis of Probabilistic Lossy Channel Systems. ICALP (2003)
Parosh Aziz Abdulla, Alexander Moshe Rabinovich
Verification of Probabilistic Systems with Faulty Communication. FoSSaCS (2003)
Yoram Hirshfeld, Alexander Moshe Rabinovich
Future temporal logic needs infinitely many modalities. Inf. Comput. 187 (2) (2003)
Alexander Moshe Rabinovich
Automata over continuous time. Theor. Comput. Sci. 300 (1-3) (2003)
Faron Moller, Alexander Moshe Rabinovich
: on the expressive power of monadic path logic. Inf. Comput. 184 (1) (2003)
Alexander Moshe Rabinovich
Finite variability interpretation of monadic logic of order. Theor. Comput. Sci. 275 (1-2) (2002)
Alexander Moshe Rabinovich
Expressive Power of Temporal Logics. CONCUR (2002)
Y. Abramson, Alexander Moshe Rabinovich
Decidability of Split Equivalence. Inf. Comput. 173 (1) (2002)
Danièle Beauquier, Alexander Moshe Rabinovich
Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12 (2) (2002)
Yuri Gurevich, Alexander Moshe Rabinovich
Definability in Rationals with Real Order in the Background. J. Log. Comput. 12 (1) (2002)
Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
A Logic of Probability with Decidable Model-Checking. CSL (2002)
Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko
The Probability Nesting Game. EXPRESS (2002)
Alexander Moshe Rabinovich, Shahar Maoz
An Infinite Hierarchy of Temporal Logics over Branching Time. Inf. Comput. 171 (2) (2001)
Alexander Moshe Rabinovich
Succinctness Gap between Monadic Logic and Duration Calculus. Fundam. Informaticae 42 (2) (2000)
Alexander Moshe Rabinovich
Symbolic model checking for µ-calculus requires exponential time. Theor. Comput. Sci. 243 (1-2) (2000)
Yuri Gurevich, Alexander Moshe Rabinovich
Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65 (2) (2000)
Alexander Moshe Rabinovich
Star free expressions over the reals. Theor. Comput. Sci. 233 (1-2) (2000)
Alexander Moshe Rabinovich
Expressive Completeness of Duration Calculus. Inf. Comput. 156 (1-2) (2000)
Alexander Moshe Rabinovich, Shahar Maoz
Why so Many Temporal Logics Climb up the Trees? MFCS (2000)
Faron Moller, Alexander Moshe Rabinovich
On the Expressive Power of CTL. LICS (1999)
Yoram Hirshfeld, Alexander Moshe Rabinovich
A Framework for Decidable Metrical Logics. ICALP (1999)
Yoram Hirshfeld, Alexander Moshe Rabinovich
Quantitative Temporal Logic. CSL (1999)
Alexander Moshe Rabinovich
Expressive Completeness of Temporal Logic of Action. MFCS (1998)
Alexander Moshe Rabinovich
On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. Theor. Comput. Sci. 193 (1-2) (1998)
Alexander Moshe Rabinovich
On the Decidability of Continuous Time Specification Formalisms. J. Log. Comput. 8 (5) (1998)
Alexander Moshe Rabinovich
Non-Elementary Lower Bound for Propositional Duration Calculus. Inf. Process. Lett. 66 (1) (1998)
Alexander Moshe Rabinovich
Modularity and Expressibility for Nets of Relations. Acta Informatica 35 (4) (1998)
Alexander Moshe Rabinovich
On Schematological Equivalence of Partially Interpreted Dataflow Networks. Inf. Comput. 138 (1) (1997)
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
From Finite Automata toward Hybrid Systems (Extended Abstract). FCT (1997)
Alexander Moshe Rabinovich
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. Inf. Comput. 139 (2) (1997)
Alexander Moshe Rabinovich
On expressive completeness of duration and mean value calculi. EXPRESS (1997)
Albert R. Meyer, Alexander Moshe Rabinovich
A solution of an interleaving decision problem by a partial order technique. Partial Order Methods in Verification (1996)
Alexander Moshe Rabinovich
On Schematological Equivalence of Dataflow Networks. Inf. Comput. 124 (2) (1996)
Marc R. Best, Marat V. Burnashev, Yannick Lévy, 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 Trans. Inf. Theory 41 (2) (1995)
A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
Covering properties of convolutional codes and associated lattices. IEEE Trans. Inf. Theory 41 (3) (1995)
A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
Sequence Based Methods for Data Transmission and Source Compression. AAECC (1993)
Alexander Moshe Rabinovich
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors. MFPS (1993)
Alexander Moshe Rabinovich
Logic of Trace Languages (Extended Abstract). CONCUR (1992)
Alexander Moshe Rabinovich
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). ICALP (1992)
Alexander Moshe Rabinovich
Non Modularity and Expressibility for Nets of Relations. LFCS (1992)
A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich
Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources. Coding And Quantization (1992)
Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
Connectedness and Synchronization. Theor. Comput. Sci. 90 (1) (1991)
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
On Nets, Algebras and Modularity. TACS (1991)
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
Communication among Relations (Extended Abstract). ICALP (1990)
Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
Discerning Causality in Interleaving Behavior. Logic at Botik (1989)
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
Nets and Data Flow Interpreters LICS (1989)
Alexander Moshe Rabinovich, Boris A. Trakhtenbrot
Nets of processes and data flow. REX Workshop (1988)
Alexander Moshe Rabinovich
Pomset semantics is consistenct with data flow semantics. Bull. EATCS 32 (1987)