Alexander Moshe Rabinovich

According to our database, Alexander Moshe Rabinovich authored at least 117 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Automatic Radar-Based Step Length Measurement in the Home for Older Adults Living with Frailty.

Parthipan Siva, Alexander Wong, Patricia Hewston, George Ioannidis, Jonathan Adachi, Alexander Rabinovich, Andrea Lee, Alexandra Papaioannou

Sensors, February, 2024

Step length measurement in the wild using FMCW radar.

Parthipan Siva, Alexander Wong, Patricia Hewston, George Ioannidis, Jonathan Adachi, Alexander Rabinovich, Andrea Lee, Alexandra Papaioannou

CoRR, 2024

2022

Preface.

Arnon Avron, Nachum Dershowitz, Alexander Rabinovich

Fundam. Informaticae, 2022

On Uniformization in the Full Binary Tree.

Alexander Rabinovich

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Ambiguity Hierarchy of Regular Infinite Tree Languages.

Alexander Rabinovich, Doron Tiferet

Log. Methods Comput. Sci., 2021

On degrees of ambiguity for Büchi tree automata.

Alexander Rabinovich, Doron Tiferet

Inf. Comput., 2021

Degrees of Ambiguity for Parity Tree Automata.

Alexander Rabinovich, Doron Tiferet

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

The Expressive Power of Temporal and First-Order Metric Logics.

Alexander Rabinovich

Proceedings of the Fields of Logic and Computation III, 2020

2019

Some complexity results for stateful network verification.

Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner

Formal Methods Syst. Des., 2019

2018

A Proof of Stavi's Theorem.

Alexander Rabinovich

Log. Methods Comput. Sci., 2018

Complementation of Finitely Ambiguous Büchi Automata.

Alexander Rabinovich

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2016

Foreword.

Ofer Arieli, Beata Konikowska, Alexander Rabinovich, Anna Zamansky

J. Log. Comput., 2016

No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic.

Dorit Pardo, Alexander Moshe Rabinovich

Inf. Comput., 2016

On Expressive Power of Regular Expressions over Infinite Orders.

Alexander Rabinovich

Proceedings of the Computer Science - Theory and Applications, 2016

2015

The complexity of multi-mean-payoff and multi-energy games.

Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin

Inf. Comput., 2015

On Almost Future Temporal Logics.

Alexander Rabinovich

Proceedings of the Fields of Logic and Computation II, 2015

2014

A Proof of Kamp's theorem.

Alexander Rabinovich

Log. Methods Comput. Sci., 2014

2013

An Unusual Temporal Logic.

Alexander Rabinovich

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

On countable chains having decidable monadic theory.

Alexis Bès, Alexander Rabinovich

J. Symb. Log., 2012

The Church problem for expansions of (N, <) by unary predicates.

Alexander Rabinovich

Inf. Comput., 2012

Temporal logics over linear time domains are in PSPACE.

Alexander Rabinovich

Inf. Comput., 2012

Continuous time temporal logic with counting.

Yoram Hirshfeld, Alexander Rabinovich

Inf. Comput., 2012

A Finite Basis for 'Almost Future' Temporal Logic over the Reals.

Dorit Pardo Ordentlich, Alexander Rabinovich

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Interpretations in Trees with Countably Many Branches.

Alexander Rabinovich, Sasha Rubin

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Expressing cardinality quantifiers in monadic second-order logic over chains.

Vince Bárány, Lukasz Kaiser, Alexander Rabinovich

J. Symb. Log., 2011

Decidable Expansions of Labelled Linear Orderings

Alexis Bès, Alexander Rabinovich

Log. Methods Comput. Sci., 2011

Church Synthesis Problem for Noisy Input.

Yaron Velner, Alexander Rabinovich

Proceedings of the Foundations of Software Science and Computational Structures, 2011

The Church Synthesis Problem with Metric.

Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell

Proceedings of the Computer Science Logic, 2011

2010

Complexity of metric temporal logics with counting and the Pnueli modalities.

Alexander Rabinovich

Theor. Comput. Sci., 2010

The full binary tree cannot be interpreted in a chain.

Alexander Rabinovich

J. Symb. Log., 2010

Decidable fragments of many-sorted logic.

Aharon Abadi, Alexander Rabinovich, Mooly Sagiv

J. Symb. Comput., 2010

On the Borel Complexity of MSO Definable Sets of Branches.

Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak

Fundam. Informaticae, 2010

Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees.

Vince Bárány, Lukasz Kaiser, Alexander Moshe Rabinovich

Fundam. Informaticae, 2010

The complexity of linear-time temporal logic over the class of ordinals

Stéphane Demri, Alexander Rabinovich

Log. Methods Comput. Sci., 2010

Selection over classes of ordinals expanded by monadic predicates.

Alexander Rabinovich, Amit Shomrat

Ann. Pure Appl. Log., 2010

Alternating Timed Automata over Bounded Time.

Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

The Church Problem for Countable Ordinals

Alexander Rabinovich

Log. Methods Comput. Sci., 2009

Synthesis of Finite-state and Definable Winning Strategies.

Alexander Rabinovich

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Decidable Extensions of Church's Problem.

Alexander Rabinovich

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Cardinality Quantifiers in MLO over Trees.

Vince Bárány, Lukasz Kaiser, Alexander Rabinovich

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Time-Bounded Verification.

Joël Ouaknine, Alexander Rabinovich, James Worrell

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Arity hierarchy for temporal logics.

Alexander Rabinovich

Theor. Comput. Sci., 2008

Selection in the monadic theory of a countable ordinal.

Alexander Rabinovich, Amit Shomrat

J. Symb. Log., 2008

Decidable metric logics.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Inf. Comput., 2008

Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey.

Alexander Rabinovich, Amit Shomrat

Proceedings of the Pillars of Computer Science, 2008

Boris A. Trakhtenbrot: Academic Genealogy and Publications.

Arnon Avron, Nachum Dershowitz, Alexander Rabinovich

Proceedings of the Pillars of Computer Science, 2008

2007

On compositionality and its limitations.

Alexander Rabinovich

ACM Trans. Comput. Log., 2007

The Church Synthesis Problem with Parameters.

Alexander Rabinovich

Log. Methods Comput. Sci., 2007

Expressiveness of Metric modalities for continuous time.

Yoram Hirshfeld, Alexander Rabinovich

Log. Methods Comput. Sci., 2007

A logic of reachable patterns in linked data-structures.

Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani

J. Log. Algebraic Methods Program., 2007

On decidability of monadic logic of order over the naturals extended by monadic predicates.

Alexander Rabinovich

Inf. Comput., 2007

Temporal logics with incommensurable distances are undecidable.

Alexander Rabinovich

Inf. Comput., 2007

Composition Theorem for Generalized Sum.

Alexander Rabinovich

Fundam. Informaticae, 2007

The Complexity of Temporal Logic with Until and Since over Ordinals.

Stéphane Demri, Alexander Rabinovich

Proceedings of the Logic for Programming, 2007

Logical Refinements of Church's Problem.

Alexander Rabinovich, Wolfgang Thomas

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

A Logic of Probability with Decidable Model Checking.

Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko

J. Log. Comput., 2006

BTL₂ and the expressive power of ECTL⁺.

Alexander Rabinovich, Philippe Schnoebelen

Inf. Comput., 2006

Quantitative analysis of probabilistic lossy channel systems.

Alexander Rabinovich

Inf. Comput., 2006

An Expressive Temporal Logic for Real Time.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Decidability and Expressive Power of Real Time Logics.

Alexander Moshe Rabinovich

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.

Alexander Moshe Rabinovich, Wolfgang Thomas

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Timer formulas and decidable metric temporal logic.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Inf. Comput., 2005

Verification of probabilistic systems with faulty communication.

Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen

Inf. Comput., 2005

2004

Selection and Uniformization in Generalized Product.

Alexander Moshe Rabinovich

Log. J. IGPL, 2004

Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness.

Dorit Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Fundam. Informaticae, 2004

Logics for Real Time: Decidability and Complexity.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Fundam. Informaticae, 2004

Composition Theorems for Generalized Sum and Recursively Defined Types.

Alexander Moshe Rabinovich

Proceedings of the 11th Workshop on Logic, Language, Information and Computation, 2004

The Boundary Between Decidability and Undecidability for Transitive-Closure Logics.

Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

Verification via Structure Simulation.

Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003

Automata over continuous time.

Alexander Moshe Rabinovich

Theor. Comput. Sci., 2003

Counting on CTL^*: on the expressive power of monadic path logic.

Faron Moller, Alexander Moshe Rabinovich

Inf. Comput., 2003

Future temporal logic needs infinitely many modalities.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Inf. Comput., 2003

Verification of Probabilistic Systems with Faulty Communication.

Parosh Aziz Abdulla, Alexander Moshe Rabinovich

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

Finite variability interpretation of monadic logic of order.

Alexander Moshe Rabinovich

Theor. Comput. Sci., 2002

Definability in Rationals with Real Order in the Background.

Yuri Gurevich, Alexander Moshe Rabinovich

J. Log. Comput., 2002

Monadic Logic of Order over Naturals has no Finite Base.

Danièle Beauquier, Alexander Moshe Rabinovich

J. Log. Comput., 2002

Valid Identity Problem for Shuffle Regular Expressions.

Albert R. Meyer, Alexander Rabinovich

J. Autom. Lang. Comb., 2002

Decidability of Split Equivalence.

Y. Abramson, Alexander Moshe Rabinovich

Inf. Comput., 2002

The Probability Nesting Game.

Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Expressive Power of Temporal Logics.

Alexander Moshe Rabinovich

Proceedings of the CONCUR 2002, 2002

2001

An Infinite Hierarchy of Temporal Logics over Branching Time.

Alexander Moshe Rabinovich, Shahar Maoz

Inf. Comput., 2001

2000

Symbolic model checking for µ-calculus requires exponential time.

Alexander Moshe Rabinovich

Theor. Comput. Sci., 2000

Star free expressions over the reals.

Alexander Moshe Rabinovich

Theor. Comput. Sci., 2000

Definability and Undefinability with Real Order at The Background.

Yuri Gurevich, Alexander Moshe Rabinovich

J. Symb. Log., 2000

Expressive Completeness of Duration Calculus.

Alexander Moshe Rabinovich

Inf. Comput., 2000

Succinctness Gap between Monadic Logic and Duration Calculus.

Alexander Moshe Rabinovich

Fundam. Informaticae, 2000

Why so Many Temporal Logics Climb up the Trees?

Alexander Moshe Rabinovich, Shahar Maoz

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

On the Expressive Power of CTL.

Faron Moller, Alexander Moshe Rabinovich

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

A Framework for Decidable Metrical Logics.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Proceedings of the Automata, 1999

Quantitative Temporal Logic.

Yoram Hirshfeld, Alexander Moshe Rabinovich

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998

On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic.

Alexander Moshe Rabinovich

Theor. Comput. Sci., 1998

On the Decidability of Continuous Time Specification Formalisms.

Alexander Moshe Rabinovich

J. Log. Comput., 1998

Non-Elementary Lower Bound for Propositional Duration Calculus.

Alexander Moshe Rabinovich

Inf. Process. Lett., 1998

Modularity and Expressibility for Nets of Relations.

Alexander Moshe Rabinovich

Acta Informatica, 1998

Expressive Completeness of Temporal Logic of Action.

Alexander Moshe Rabinovich

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Complexity of Equivalence Problems for Concurrent Systems of Finite Agents.

Alexander Moshe Rabinovich

Inf. Comput., 1997

On Schematological Equivalence of Partially Interpreted Dataflow Networks.

Alexander Moshe Rabinovich

Inf. Comput., 1997

On expressive completeness of duration and mean value calculi.

Alexander Moshe Rabinovich

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

From Finite Automata toward Hybrid Systems (Extended Abstract).

Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

On Schematological Equivalence of Dataflow Networks.

Alexander Moshe Rabinovich

Inf. Comput., 1996

A solution of an interleaving decision problem by a partial order technique.

Albert R. Meyer, Alexander Moshe Rabinovich

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

1995

Covering properties of convolutional codes and associated lattices.

A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich

IEEE Trans. Inf. Theory, 1995

On a technique to calculate the exact performance of a convolutional code.

Marc R. Best, Marat V. Burnashev, Yannick Lévy, Alexander Moshe Rabinovich, Peter C. Fishburn, A. Robert Calderbank, Daniel J. Costello Jr.

IEEE Trans. Inf. Theory, 1995

1993

A Complete Axiomatisation for Trace Congruence of Finite State Behaviors.

Alexander Moshe Rabinovich

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

Sequence Based Methods for Data Transmission and Source Compression.

A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich

Proceedings of the Applied Algebra, 1993

1992

Non Modularity and Expressibility for Nets of Relations.

Alexander Moshe Rabinovich

Proceedings of the Logical Foundations of Computer Science, 1992

Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract).

Alexander Moshe Rabinovich

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources.

A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich

Proceedings of the Coding And Quantization, 1992

Logic of Trace Languages (Extended Abstract).

Alexander Moshe Rabinovich

Proceedings of the CONCUR '92, 1992

1991

Connectedness and Synchronization.

Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Theor. Comput. Sci., 1991

On Nets, Algebras and Modularity.

Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Theoretical Aspects of Computer Software, 1991

1990

Communication among Relations (Extended Abstract).

Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Nets and Data Flow Interpreters

Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Discerning Causality in Interleaving Behavior.

Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Logic at Botik '89, 1989

1988

Nets and processes

Alexander Moshe Rabinovich

PhD thesis, 1988

Nets of processes and data flow.

Alexander Moshe Rabinovich, Boris A. Trakhtenbrot

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1987

Pomset semantics is consistenct with data flow semantics.

Alexander Moshe Rabinovich

Bull. EATCS, 1987