Alexander Moshe Rabinovich
According to our database^{1},
Alexander Moshe Rabinovich
authored at least 110 papers
between 1987 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
A Proof of Stavi's Theorem.
Logical Methods in Computer Science, 2018
Complementation of Finitely Ambiguous Büchi Automata.
Proceedings of the Developments in Language Theory  22nd International Conference, 2018
2016
Foreword.
J. Log. Comput., 2016
No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic.
Inf. Comput., 2016
Some Complexity Results for Stateful Network Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016
On Expressive Power of Regular Expressions over Infinite Orders.
Proceedings of the Computer Science  Theory and Applications, 2016
2015
The complexity of multimeanpayoff and multienergy games.
Inf. Comput., 2015
On Almost Future Temporal Logics.
Proceedings of the Fields of Logic and Computation II, 2015
2013
An Unusual Temporal Logic.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
2012
On countable chains having decidable monadic theory.
J. Symb. Log., 2012
The Church problem for expansions of (N, <) by unary predicates.
Inf. Comput., 2012
Continuous time temporal logic with counting.
Inf. Comput., 2012
A Finite Basis for 'Almost Future' Temporal Logic over the Reals.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Interpretations in Trees with Countably Many Branches.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
A Proof of Kamp's theorem.
Proceedings of the Computer Science Logic (CSL'12), 2012
2011
Expressing cardinality quantifiers in monadic secondorder logic over chains.
J. Symb. Log., 2011
Decidable Expansions of Labelled Linear Orderings
Logical Methods in Computer Science, 2011
Church Synthesis Problem for Noisy Input.
Proceedings of the Foundations of Software Science and Computational Structures, 2011
The Church Synthesis Problem with Metric.
Proceedings of the Computer Science Logic, 2011
2010
The full binary tree cannot be interpreted in a chain.
J. Symb. Log., 2010
On the Borel Complexity of MSO Definable Sets of Branches.
Fundam. Inform., 2010
Expressing Cardinality Quantifiers in Monadic SecondOrder Logic over Trees.
Fundam. Inform., 2010
The complexity of lineartime temporal logic over the class of ordinals
Logical Methods in Computer Science, 2010
Selection over classes of ordinals expanded by monadic predicates.
Ann. Pure Appl. Logic, 2010
Temporal Logics over Linear Time Domains Are in PSPACE.
Proceedings of the Reachability Problems, 4th International Workshop, 2010
Alternating Timed Automata over Bounded Time.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010
Decidable Expansions of Labelled Linear Orderings.
Proceedings of the Fields of Logic and Computation, 2010
2009
The Church Problem for Countable Ordinals
Logical Methods in Computer Science, 2009
Synthesis of Finitestate and Definable Winning Strategies.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
Decidable Extensions of Church's Problem.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009
Cardinality Quantifiers in MLO over Trees.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009
TimeBounded Verification.
Proceedings of the CONCUR 2009  Concurrency Theory, 20th International Conference, 2009
2008
Arity hierarchy for temporal logics.
Theor. Comput. Sci., 2008
Selection in the monadic theory of a countable ordinal.
J. Symb. Log., 2008
Decidable metric logics.
Inf. Comput., 2008
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey.
Proceedings of the Pillars of Computer Science, 2008
Boris A. Trakhtenbrot: Academic Genealogy and Publications.
Proceedings of the Pillars of Computer Science, 2008
2007
On compositionality and its limitations.
ACM Trans. Comput. Log., 2007
The Church Synthesis Problem with Parameters.
Logical Methods in Computer Science, 2007
On decidability of monadic logic of order over the naturals extended by monadic predicates.
Inf. Comput., 2007
Temporal logics with incommensurable distances are undecidable.
Inf. Comput., 2007
Composition Theorem for Generalized Sum.
Fundam. Inform., 2007
The Complexity of Temporal Logic with Until and Since over Ordinals.
Proceedings of the Logic for Programming, 2007
Decidable Fragments of ManySorted Logic.
Proceedings of the Logic for Programming, 2007
Logical Refinements of Church's Problem.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007
2006
BTL_{2} and the expressive power of ECTL^{+}.
Inf. Comput., 2006
An Expressive Temporal Logic for Real Time.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
A Logic of Reachable Patterns in Linked DataStructures.
Proceedings of the Foundations of Software Science and Computation Structures, 2006
Decidability and Expressive Power of Real Time Logics.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006
Expressiveness of Metric Modalities for Continuous Time.
Proceedings of the Computer Science, 2006
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006
Church Synthesis Problem with Parameters.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006
2005
Timer formulas and decidable metric temporal logic.
Inf. Comput., 2005
Verification of probabilistic systems with faulty communication.
Inf. Comput., 2005
Composition Theorems for Generalized Sum and Recursively Defined Types.
Electr. Notes Theor. Comput. Sci., 2005
2004
Selection and Uniformization in Generalized Product.
Logic Journal of the IGPL, 2004
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness.
Fundam. Inform., 2004
Logics for Real Time: Decidability and Complexity.
Fundam. Inform., 2004
The Boundary Between Decidability and Undecidability for TransitiveClosure Logics.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004
Verification via Structure Simulation.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004
2003
Automata over continuous time.
Theor. Comput. Sci., 2003
Counting on CTL^{*}: on the expressive power of monadic path logic.
Inf. Comput., 2003
Future temporal logic needs infinitely many modalities.
Inf. Comput., 2003
Quantitative Analysis of Probabilistic Lossy Channel Systems.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Verification of Probabilistic Systems with Faulty Communication.
Proceedings of the Foundations of Software Science and Computational Structures, 2003
2002
Finite variability interpretation of monadic logic of order.
Theor. Comput. Sci., 2002
Definability in Rationals with Real Order in the Background.
J. Log. Comput., 2002
Monadic Logic of Order over Naturals has no Finite Base.
J. Log. Comput., 2002
Valid Identity Problem for Shuffle Regular Expressions.
Journal of Automata, Languages and Combinatorics, 2002
Decidability of Split Equivalence.
Inf. Comput., 2002
The Probability Nesting Game.
Electr. Notes Theor. Comput. Sci., 2002
A Logic of Probability with Decidable ModelChecking.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002
Expressive Power of Temporal Logics.
Proceedings of the CONCUR 2002, 2002
2001
An Infinite Hierarchy of Temporal Logics over Branching Time.
Inf. Comput., 2001
2000
Symbolic model checking for µcalculus requires exponential time.
Theor. Comput. Sci., 2000
Star free expressions over the reals.
Theor. Comput. Sci., 2000
Definability and Undefinability with Real Order at The Background.
J. Symb. Log., 2000
Expressive Completeness of Duration Calculus.
Inf. Comput., 2000
Succinctness Gap between Monadic Logic and Duration Calculus.
Fundam. Inform., 2000
Why so Many Temporal Logics Climb up the Trees?
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
1999
On the Expressive Power of CTL.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999
A Framework for Decidable Metrical Logics.
Proceedings of the Automata, 1999
Quantitative Temporal Logic.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999
1998
On Translations of Temporal Logic of Actions Into Monadic SecondOrder Logic.
Theor. Comput. Sci., 1998
On the Decidability of Continuous Time Specification Formalisms.
J. Log. Comput., 1998
NonElementary Lower Bound for Propositional Duration Calculus.
Inf. Process. Lett., 1998
Modularity and Expressibility for Nets of Relations.
Acta Inf., 1998
Expressive Completeness of Temporal Logic of Action.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents.
Inf. Comput., 1997
On Schematological Equivalence of Partially Interpreted Dataflow Networks.
Inf. Comput., 1997
On expressive completeness of duration and mean value calculi.
Electr. Notes Theor. Comput. Sci., 1997
From Finite Automata toward Hybrid Systems (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
1996
On Schematological Equivalence of Dataflow Networks.
Inf. Comput., 1996
A solution of an interleaving decision problem by a partial order technique.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996
1995
Covering properties of convolutional codes and associated lattices.
IEEE Trans. Information Theory, 1995
On a technique to calculate the exact performance of a convolutional code.
IEEE Trans. Information Theory, 1995
1993
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993
Sequence Based Methods for Data Transmission and Source Compression.
Proceedings of the Applied Algebra, 1993
1992
Non Modularity and Expressibility for Nets of Relations.
Proceedings of the Logical Foundations of Computer Science, 1992
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources.
Proceedings of the Coding And Quantization, 1992
Logic of Trace Languages (Extended Abstract).
Proceedings of the CONCUR '92, 1992
1991
Connectedness and Synchronization.
Theor. Comput. Sci., 1991
On Nets, Algebras and Modularity.
Proceedings of the Theoretical Aspects of Computer Software, 1991
1990
Communication among Relations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
1989
Nets and Data Flow Interpreters
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989
Discerning Causality in Interleaving Behavior.
Proceedings of the Logic at Botik '89, 1989
1988
Nets of processes and data flow.
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.
Bulletin of the EATCS, 1987