The following pages link to Alexander Rabinovich (Q259067):
Displaying 50 items.
- No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic (Q259068) (← links)
- Temporal logics over linear time domains are in PSPACE (Q418122) (← links)
- Continuous time temporal logic with counting (Q418179) (← links)
- Selection over classes of ordinals expanded by monadic predicates (Q636340) (← links)
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
- Temporal logics with incommensurable distances are undecidable (Q879597) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Complexity of metric temporal logics with counting and the Pnueli modalities (Q974119) (← links)
- Decidable fragments of many-sorted logic (Q1041587) (← links)
- Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926) (← links)
- (Q1127536) (redirect page) (← links)
- On translations of temporal logic of actions into monadic second-order logic (Q1127537) (← links)
- Non-elementary lower bound for Propositional Duration Calculus (Q1129106) (← links)
- Modularity and expressibility for nets of relations (Q1130157) (← links)
- Connectedness and synchronization (Q1179707) (← links)
- On schematological equivalence of partially interpreted dataflow networks (Q1373139) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- Automata over continuous time (Q1399970) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- Star free expressions over the reals (Q1575940) (← links)
- Finite variability interpretation of monadic logic of order (Q1606122) (← links)
- Complementation of finitely ambiguous Büchi automata (Q1623004) (← links)
- Timer formulas and decidable metric temporal logic (Q1780454) (← links)
- Expressive completeness of duration calculus. (Q1854330) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Decidability of split equivalence (Q1854504) (← links)
- Future temporal logic needs infinitely many modalities (Q1877549) (← links)
- On schematological equivalence of dataflow networks (Q1917073) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- On decidability of monadic logic of order over the naturals extended by monadic predicates (Q2373700) (← links)
- Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- (Q2757837) (← links)
- The probability nesting game (Q2842598) (← links)
- An Unusual Temporal Logic (Q2849958) (← links)
- On countable chains having decidable monadic theory (Q2892678) (← links)
- A Finite Basis for ‘Almost Future’ Temporal Logic over the Reals (Q2912772) (← links)
- (Q2915691) (← links)
- Synthesis of Finite-state and Definable Winning Strategies. (Q2920143) (← links)
- On Almost Future Temporal Logics (Q2947179) (← links)
- Interpretations in Trees with Countably Many Branches (Q2986832) (← links)
- Church Synthesis Problem for Noisy Input (Q3000615) (← links)
- Expressing cardinality quantifiers in monadic second-order logic over chains (Q3011122) (← links)
- The full binary tree cannot be interpreted in a chain (Q3066806) (← links)
- The complexity of linear-time temporal logic over the class of ordinals (Q3081444) (← links)
