Pomset semantics is consistenct with data flow semantics. - Alexander Moshe Rabinovich (Bull. EATCS, 1987)

Nets of processes and data flow. - Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (REX Workshop, 1988)

Nets and processes - Alexander Moshe Rabinovich (1988)

Discerning Causality in Interleaving Behavior. - Yoram Hirshfeld; Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (Logic at Botik, 1989)

Nets and Data Flow Interpreters - Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (LICS, 1989)

Communication among Relations (Extended Abstract). - Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (ICALP, 1990)

On Nets, Algebras and Modularity. - Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (TACS, 1991)

Connectedness and Synchronization. - Antoni W. Mazurkiewicz; Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (Theor. Comput. Sci., 1991)

Logic of Trace Languages (Extended Abstract). - Alexander Moshe Rabinovich (CONCUR, 1992)

Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources. - A. Robert Calderbank; Peter C. Fishburn; Alexander Moshe Rabinovich (Coding And Quantization, 1992)

Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). - Alexander Moshe Rabinovich (ICALP, 1992)

Non Modularity and Expressibility for Nets of Relations. - Alexander Moshe Rabinovich (LFCS, 1992)

Sequence Based Methods for Data Transmission and Source Compression. - A. Robert Calderbank; Peter C. Fishburn; Alexander Moshe Rabinovich (AAECC, 1993)

A Complete Axiomatisation for Trace Congruence of Finite State Behaviors. - Alexander Moshe Rabinovich (MFPS, 1993)

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)

Covering properties of convolutional codes and associated lattices. - A. Robert Calderbank; Peter C. Fishburn; Alexander Moshe Rabinovich (IEEE Trans. Inf. Theory, 1995)

A solution of an interleaving decision problem by a partial order technique. - Albert R. Meyer; Alexander Moshe Rabinovich (Partial Order Methods in Verification, 1996)

On Schematological Equivalence of Dataflow Networks. - Alexander Moshe Rabinovich (Inf. Comput., 1996)

From Finite Automata toward Hybrid Systems (Extended Abstract). - Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (FCT, 1997)

On expressive completeness of duration and mean value calculi. - Alexander Moshe Rabinovich (EXPRESS, 1997)

On Schematological Equivalence of Partially Interpreted Dataflow Networks. - Alexander Moshe Rabinovich (Inf. Comput., 1997)

Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. - Alexander Moshe Rabinovich (Inf. Comput., 1997)

Expressive Completeness of Temporal Logic of Action. - Alexander Moshe Rabinovich (MFCS, 1998)

Modularity and Expressibility for Nets of Relations. - Alexander Moshe Rabinovich (Acta Informatica, 1998)

Non-Elementary Lower Bound for Propositional Duration Calculus. - Alexander Moshe Rabinovich (Inf. Process. Lett., 1998)

On the Decidability of Continuous Time Specification Formalisms. - Alexander Moshe Rabinovich (J. Log. Comput., 1998)

On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. - Alexander Moshe Rabinovich (Theor. Comput. Sci., 1998)

Quantitative Temporal Logic. - Yoram Hirshfeld; Alexander Moshe Rabinovich (CSL, 1999)

A Framework for Decidable Metrical Logics. - Yoram Hirshfeld; Alexander Moshe Rabinovich (ICALP, 1999)

On the Expressive Power of CTL. - Faron Moller; Alexander Moshe Rabinovich (LICS, 1999)

Why so Many Temporal Logics Climb up the Trees? - Alexander Moshe Rabinovich; Shahar Maoz (MFCS, 2000)

Succinctness Gap between Monadic Logic and Duration Calculus. - Alexander Moshe Rabinovich (Fundam. Informaticae, 2000)

Expressive Completeness of Duration Calculus. - Alexander Moshe Rabinovich (Inf. Comput., 2000)

Definability and Undefinability with Real Order at The Background. - Yuri Gurevich; Alexander Moshe Rabinovich (J. Symb. Log., 2000)

Star free expressions over the reals. - Alexander Moshe Rabinovich (Theor. Comput. Sci., 2000)

Symbolic model checking for µ-calculus requires exponential time. - Alexander Moshe Rabinovich (Theor. Comput. Sci., 2000)

An Infinite Hierarchy of Temporal Logics over Branching Time. - Alexander Moshe Rabinovich; Shahar Maoz (Inf. Comput., 2001)

Expressive Power of Temporal Logics. - Alexander Moshe Rabinovich (CONCUR, 2002)

The Probability Nesting Game. - Danièle Beauquier; Yoram Hirshfeld; Alexander Moshe Rabinovich; Anatol Slissenko (EXPRESS, 2002)

Decidability of Split Equivalence. - Y. Abramson; Alexander Moshe Rabinovich (Inf. Comput., 2002)

Valid Identity Problem for Shuffle Regular Expressions. - Albert R. Meyer; Alexander Rabinovich (J. Autom. Lang. Comb., 2002)

Monadic Logic of Order over Naturals has no Finite Base. - Danièle Beauquier; Alexander Moshe Rabinovich (J. Log. Comput., 2002)

Definability in Rationals with Real Order in the Background. - Yuri Gurevich; Alexander Moshe Rabinovich (J. Log. Comput., 2002)

Finite variability interpretation of monadic logic of order. - Alexander Moshe Rabinovich (Theor. Comput. Sci., 2002)

Verification of Probabilistic Systems with Faulty Communication. - Parosh Aziz Abdulla; Alexander Moshe Rabinovich (FoSSaCS, 2003)

Future temporal logic needs infinitely many modalities. - Yoram Hirshfeld; Alexander Moshe Rabinovich (Inf. Comput., 2003)

Counting on CTL*: on the expressive power of monadic path logic. - Faron Moller; Alexander Moshe Rabinovich (Inf. Comput., 2003)

Automata over continuous time. - Alexander Moshe Rabinovich (Theor. Comput. Sci., 2003)

Verification via Structure Simulation. - Neil Immerman; Alexander Moshe Rabinovich; Thomas W. Reps; Shmuel Sagiv; Greta Yorsh (CAV, 2004)

The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. - Neil Immerman; Alexander Moshe Rabinovich; Thomas W. Reps; Shmuel Sagiv; Greta Yorsh (CSL, 2004)

Composition Theorems for Generalized Sum and Recursively Defined Types. - Alexander Moshe Rabinovich (WoLLIC, 2004)

Logics for Real Time: Decidability and Complexity. - Yoram Hirshfeld; Alexander Moshe Rabinovich (Fundam. Informaticae, 2004)

Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. - Dorit Pardo; Alexander Moshe Rabinovich; Boris A. Trakhtenbrot (Fundam. Informaticae, 2004)

Selection and Uniformization in Generalized Product. - Alexander Moshe Rabinovich (Log. J. IGPL, 2004)

Verification of probabilistic systems with faulty communication. - Parosh Aziz Abdulla; Nathalie Bertrand 001; Alexander Moshe Rabinovich; Philippe Schnoebelen (Inf. Comput., 2005)

Timer formulas and decidable metric temporal logic. - Yoram Hirshfeld; Alexander Moshe Rabinovich (Inf. Comput., 2005)

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. - Alexander Moshe Rabinovich; Wolfgang Thomas (CSL, 2006)

Decidability and Expressive Power of Real Time Logics. - Alexander Moshe Rabinovich (FORMATS, 2006)

An Expressive Temporal Logic for Real Time. - Yoram Hirshfeld; Alexander Moshe Rabinovich (MFCS, 2006)

Quantitative analysis of probabilistic lossy channel systems. - Alexander Rabinovich (Inf. Comput., 2006)

BTL2 and the expressive power of ECTL+. - Alexander Rabinovich; Philippe Schnoebelen (Inf. Comput., 2006)

A Logic of Probability with Decidable Model Checking. - Danièle Beauquier; Alexander Moshe Rabinovich; Anatol Slissenko (J. Log. Comput., 2006)

Logical Refinements of Church's Problem. - Alexander Rabinovich; Wolfgang Thomas (CSL, 2007)

The Complexity of Temporal Logic with Until and Since over Ordinals. - Stéphane Demri; Alexander Rabinovich (LPAR, 2007)

Composition Theorem for Generalized Sum. - Alexander Rabinovich (Fundam. Informaticae, 2007)

Temporal logics with incommensurable distances are undecidable. - Alexander Rabinovich (Inf. Comput., 2007)

On decidability of monadic logic of order over the naturals extended by monadic predicates. - Alexander Rabinovich (Inf. Comput., 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)

Expressiveness of Metric modalities for continuous time. - Yoram Hirshfeld; Alexander Rabinovich (Log. Methods Comput. Sci., 2007)

The Church Synthesis Problem with Parameters. - Alexander Rabinovich (Log. Methods Comput. Sci., 2007)

On compositionality and its limitations. - Alexander Rabinovich (ACM Trans. Comput. Log., 2007)

Boris A. Trakhtenbrot: Academic Genealogy and Publications. - Arnon Avron; Nachum Dershowitz; Alexander Rabinovich (Pillars of Computer Science, 2008)

Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. - Alexander Rabinovich; Amit Shomrat (Pillars of Computer Science, 2008)

Decidable metric logics. - Yoram Hirshfeld; Alexander Moshe Rabinovich (Inf. Comput., 2008)

Selection in the monadic theory of a countable ordinal. - Alexander Rabinovich; Amit Shomrat (J. Symb. Log., 2008)

Arity hierarchy for temporal logics. - Alexander Rabinovich (Theor. Comput. Sci., 2008)

Time-Bounded Verification. - Joël Ouaknine; Alexander Rabinovich; James Worrell 001 (CONCUR, 2009)

Cardinality Quantifiers in MLO over Trees. - Vince Bárány; Lukasz Kaiser; Alexander Rabinovich (CSL, 2009)

Decidable Extensions of Church's Problem. - Alexander Rabinovich (CSL, 2009)

Synthesis of Finite-state and Definable Winning Strategies. - Alexander Rabinovich (FSTTCS, 2009)

The Church Problem for Countable Ordinals - Alexander Rabinovich (Log. Methods Comput. Sci., 2009)

Alternating Timed Automata over Bounded Time. - Mark Jenkins; Joël Ouaknine; Alexander Rabinovich; James Worrell 001 (LICS, 2010)

Selection over classes of ordinals expanded by monadic predicates. - Alexander Rabinovich; Amit Shomrat (Ann. Pure Appl. Log., 2010)

The complexity of linear-time temporal logic over the class of ordinals - Stéphane Demri; Alexander Rabinovich (Log. Methods Comput. Sci., 2010)

Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees. - Vince Bárány; Lukasz Kaiser; Alexander Moshe Rabinovich (Fundam. Informaticae, 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)

Decidable fragments of many-sorted logic. - Aharon Abadi; Alexander Rabinovich; Mooly Sagiv (J. Symb. Comput., 2010)

The full binary tree cannot be interpreted in a chain. - Alexander Rabinovich (J. Symb. Log., 2010)

Complexity of metric temporal logics with counting and the Pnueli modalities. - Alexander Rabinovich (Theor. Comput. Sci., 2010)

The Church Synthesis Problem with Metric. - Mark Jenkins; Joël Ouaknine; Alexander Rabinovich; James Worrell 001 (CSL, 2011)

Church Synthesis Problem for Noisy Input. - Yaron Velner; Alexander Rabinovich (FoSSaCS, 2011)

Decidable Expansions of Labelled Linear Orderings - Alexis Bès; Alexander Rabinovich (Log. Methods Comput. Sci., 2011)

Expressing cardinality quantifiers in monadic second-order logic over chains. - Vince Bárány; Lukasz Kaiser; Alexander Rabinovich (J. Symb. Log., 2011)

Interpretations in Trees with Countably Many Branches. - Alexander Rabinovich; Sasha Rubin (LICS, 2012)

A Finite Basis for 'Almost Future' Temporal Logic over the Reals. - Dorit Pardo Ordentlich; Alexander Rabinovich (MFCS, 2012)

Continuous time temporal logic with counting. - Yoram Hirshfeld; Alexander Rabinovich (Inf. Comput., 2012)

Temporal logics over linear time domains are in PSPACE. - Alexander Rabinovich (Inf. Comput., 2012)

The Church problem for expansions of (N, <) by unary predicates. - Alexander Rabinovich (Inf. Comput., 2012)

On countable chains having decidable monadic theory. - Alexis Bès; Alexander Rabinovich (J. Symb. Log., 2012)

An Unusual Temporal Logic. - Alexander Rabinovich (MFCS, 2013)

A Proof of Kamp's theorem. - Alexander Rabinovich (Log. Methods Comput. Sci., 2014)

On Almost Future Temporal Logics. - Alexander Rabinovich (Fields of Logic and Computation II, 2015)

The complexity of multi-mean-payoff and multi-energy games. - Yaron Velner; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Alexander Moshe Rabinovich; Jean-François Raskin (Inf. Comput., 2015)

On Expressive Power of Regular Expressions over Infinite Orders. - Alexander Rabinovich (CSR, 2016)

No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic. - Dorit Pardo; Alexander Moshe Rabinovich (Inf. Comput., 2016)

Foreword. - Ofer Arieli; Beata Konikowska; Alexander Rabinovich; Anna Zamansky (J. Log. Comput., 2016)

Complementation of Finitely Ambiguous Büchi Automata. - Alexander Rabinovich (DLT, 2018)

A Proof of Stavi's Theorem. - Alexander Rabinovich (Log. Methods Comput. Sci., 2018)

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)

The Expressive Power of Temporal and First-Order Metric Logics. - Alexander Rabinovich (Fields of Logic and Computation III, 2020)

Degrees of Ambiguity for Parity Tree Automata. - Alexander Rabinovich; Doron Tiferet (CSL, 2021)

On degrees of ambiguity for Büchi tree automata. - Alexander Rabinovich; Doron Tiferet (Inf. Comput., 2021)

Ambiguity Hierarchy of Regular Infinite Tree Languages. - Alexander Rabinovich; Doron Tiferet (Log. Methods Comput. Sci., 2021)

On Uniformization in the Full Binary Tree. - Alexander Rabinovich (MFCS, 2022)

Preface. - Arnon Avron; Nachum Dershowitz; Alexander Rabinovich (Fundam. Informaticae, 2022)

Reinforcement Learning with LTL and ω-Regular Objectives via Optimality-Preserving Translation to Average Rewards. - Xuan-Bach Le; Dominik Wagner 001; Leon Witzman; Alexander Rabinovich; Luke Ong (NeurIPS, 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)

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, 2024)

On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates. - Thomas Colcombet; Alexander Rabinovich (CSL, 2025)

The Church Synthesis Problem over Continuous Time. - Alexander Rabinovich; Daniel Fattal (Log. Methods Comput. Sci., 2025)

Synthesis of Infinite State Systems. - Ohad Drucker; Alexander Rabinovich (CoRR, 2025)