- Symbolic Model Checking for calculus Requires Exponential Time
- Information and Computation 184 (2003) 147159 www.elsevier.com/locate/ic
- Modularity and Expressibility for Nets of Relations Alexander Rabinovich
- Information and Computation 204 (2006) 10231044 www.elsevier.com/locate/ic
- Expressive Completeness of Temporal Logic of Alexander Rabinovich
- Nonelementary Lower Bound for Propositional Duration A. Rabinovich
- Monadic Logic of Order over Naturals Has no Finite Base.
- A logic of probability with decidable model-checking
- An Infinite Hierarchy of Temporal Logics over Branching Time # Alexander Rabinovich and Shahar Maoz
- Expressiveness of Metric Modalities for Continuous Time
- predicates. satisfiability
- Timer formulas and decidable metric temporal logic Yoram Hirshfeld Alexander Rabinovich
- Final Exam -Program Verification Alexander Rabinovich
- Monadic Logic Monadic logic -Signature only monadic (unary) predicates.
- Based on LNCS 2500 For Games, Logic and Automata Seminar
- Verification of Probabilistic Systems with Faulty Communication
- Information and Computation 204 (2006) 713740 www.elsevier.com/locate/ic
- A Logic of Probability with Decidable Model Checking*
- The Journal of Logic and Algebraic Programming 73 (2007) 111142 www.elsevier.com/locate/jlap
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Decidable Fragments of Many-Sorted Logic Aharon Abadi
- Fundamenta Informaticae XXI (2001) 10011013 1001 On the Borel complexity of MSO definable sets of branches
- Fundamenta Informaticae 100 (2010) 118 1 DOI 10.3233/FI-2010-262
- Church Synthesis Problem with Parameters Alexander Rabinovich
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- An Expressive Temporal Logic for Real Time Yoram Hirshfeld and Alexander Rabinovich
- Logical Refinements of Church's Problem Alexander Rabinovich1
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
- Cardinality quantifiers in MLO over trees. Vince Barany1
- Decidable Expansions of Labelled Linear Alexis B`es1
- Fundamenta Informaticae XXI (2001) 1001--1015 1001 Synchronous Circuits over Continuous Time
- Introduction Bisimulation
- On the Decidability of Continuous Time Specification A. Rabinovich
- Expressive Completeness of Duration Calculus Alexander Rabinovich
- Quantitative Analysis of Probabilistic Lossy Channel Alexander Rabinovich
- Automata over Continuous Time Alexander Rabinovich
- 1 Abstract Notion of Reduction and its properties (Ref. Barendreqt, The calculus its syntax and semantics)
- Veri cation of Probabilistic Systems with Faulty Communication
- Lecture 6: Fixed Points and elements of Domain theory Consider recursive definition of gcd
- Information and Computation 205 (2007) 707715 www.elsevier.com/locate/ic
- Journal of Automata, Languages and Combinatorics u (v) w, x--y # OttovonGuerickeUniversitat Magdeburg
- On Translations of Temporal Logic of Actions into Monadic Second Order Logic
- On Compositionality and Its Limitations ALEXANDER RABINOVICH
- Selection and Uniformization in Generalized Product
- Journal of Number Theory 130 (2010) 232253 Contents lists available at ScienceDirect
- Fixed Points and elements of Domain theory continuation 1 Examples Context free Grammars
- Definability in Rationals with Real Order in the Yuri Gurevich # Alexander Rabinovich +
- A Framework for Decidable Metrical Logics Yoram Hirshfeld and Alexander Rabinovich
- Information and Computation 206 (2008) 14251442 Contents lists available at ScienceDirect
- Information and Computation 205 (2007) 870889 www.elsevier.com/locate/ic
- Decidability of split equivalence Y. Abramson and A. Rabinovich
- Quantitative Temporal Logic Yoram Hirshfeld and Alexander Rabinovich
- A Logic of Reachable Patterns in Linked Data-Structures
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- The Complexity of Temporal Logic with Until and Since over Ordinals
- GAMES -BASIC NOTIONS Alexander Rabinovich
- Definability and Undefinability with Real Order at the Background
- Expressive Power of Temporal Logics Alexander Rabinovich
- On Schematological Equivalence of Dataflow Networks
- Lecture by Amit Cwajghaft Based on the article by Wolfgang Thomas
- Star Free Expressions over the Reals Alexander Rabinovich
- Logical Methods in Computer Science Vol. 5 (2:?) 2009, pp. 119
- Temporal logics over linear time domains are in Alexander Rabinovich
- A solution of an interleaving decision problem by a partial order technique
- Logical Methods in Computer Science Vol. 3 (4:9) 2007, pp. 124
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Decidable Fragments of Many-Sorted Logic Aharon Abadi, Alexander Rabinovich, and Mooly Sagiv
- Fundamenta Informaticae 42 (2000) 1--10 1 Succinctness Gap between
- Fundamenta Informaticae 62 (2004) 1--28 1 Logics for Real Time
- On the Expressive Power of CTL \Lambda Faron Moller
- A Complete Axiomatisation for Trace Congruence of Finite State Behaviors
- SELECTION IN THE MONADIC THEORY OF A COUNTABLE ALEXANDER RABINOVICH AND AMIT SHOMRAT
- Connectedness and Synchronization A. Mazurkiewicz \Lambda
- Electronic Notes in Theoretical Computer Science 7 (1997) URL: http://www.elsevier.nl/locate/entcs/volume7.html ?? pages
- On compositionality and its limitations Alexander Rabinovich
- 1 Syntax of simple typed -Expressions (A) Raw typed terms are de ned by the following grammar
- Logic of Trace Languages (Extended Abstract)
- Future temporal logic needs in nitely many modalities Yoram Hirshfeld Alexander Rabinovich y
- 1 Denotational Semantics for typed terms Semantical domains provides the meaning for type expressions.
- On Schematological Equivalence of Partially Interpreted
- Finite Variability Interpretation of Monadic Logic of Order
- Logical Methods in Computer Science Vol. 3 (1:3) 2007, pp. 111
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Electronic Notes in Theoretical Computer Science 68 No. 2 (2002) URL: http://www.elsevier.nl/locate/entcs/volume68.html LastPage pages
- Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
- From Finite Automata toward Hybrid Systems (Extended Abstract)
- Final Exam -Program Verification Alexander Rabinovich
- Temporal logics over linear time domains are in PSPACE Alexander Rabinovich
- Church's Problem Michael Kiperberg
- Logical Methods in Computer Science Vol. 7 (2:5) 2011, pp. 1118
- Church Synthesis Problem for Noisy Input Yaron Velner and Alexander Rabinovich
- A Deterministic Subexponential Algorithm for Parity by M. Jurdziski, M. Paterson and U. Zwick
- Introduction Finite-State Tree Automata
- The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000
- Logical Methods in Computer Science Vol. 6 (4:9) 2010, pp. 125
- EXPRESSING CARDINALITY QUANTIFIERS IN MONADIC SECOND-ORDER LOGIC OVER CHAINS
- Introduction Equivalence Between Automata and Formulae
- The surprizing complexity of generalized reachability games