7 citations · 7 across the 9 of their papers we have counts for
9 papers
ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems
Andrei Sandler, Olga Tveretina
We present the ParaPlan tool which provides the reachability analysis of planar hybrid systems defined by differential inclusions (SPDI). It uses the parallelized and optimized ver…
Resolution Simulates Ordered Binary Decision Diagrams for Formulas in Conjunctive Normal Form
Olga Tveretina
A classical question of propositional logic is one of the shortest proof of a tautology. A related fundamental problem is to determine the relative efficiency of standard proof sys…
Configuring Cloud-Service Interfaces Using Flow Inheritance
Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko
Technologies for composition of loosely-coupled web services in a modular and flexible way are in high demand today. On the one hand, the services must be flexible enough to be reu…
A Constraint Satisfaction Method for Configuring Non-Local Service Interfaces
Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko
Modularity and decontextualisation are core principles of a service-oriented architecture. However, the principles are often lost when it comes to an implementation of services, as…
Interface Reconciliation in Kahn Process Networks using CSP and SAT
Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko
We present a new CSP- and SAT-based approach for coordinating interfaces of distributed stream-connected components provided as closed-source services. The Kahn Process Network (KP…
AstraKahn: A Coordination Language for Streaming Networks
Alex Shafarenko
This is a preliminary version of the language report. It contains key definitions, specifications and some examples, but lacks completeness. The full document will include Chapter…
A Case Study in Coordination Programming: Performance Evaluation of S-Net vs Intel's Concurrent Collections
Pavel Zaichenkov, Bert Gijsbers, Clemens Grelck +2
We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-Net with Intel's Concurrent Collections (CnC). A…
Deciding Reachability for 3-Dimensional Multi-Linear Systems
Olga Tveretina, Daniel Funke
This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of region…
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Olga Tveretina, Carsten Sinz, Hans Zantema
Haken proved that every resolution refutation of the pigeonhole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeonhol…