Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Tveretina, Olga"'
Autor:
Sandler, Andrei, Tveretina, Olga
Publikováno v:
EPTCS 256, 2017, pp. 283-296
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 version of the algorithm underlying the SPeeDI tool. The performance comp
Externí odkaz:
http://arxiv.org/abs/1709.02108
Autor:
Tveretina, Olga
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 systems, where the relative complexity is measured using the notion of po
Externí odkaz:
http://arxiv.org/abs/1701.02275
Publikováno v:
EPTCS 228, 2016, pp. 27-34
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 reused in a variety of contexts. On the other hand, they must be specific
Externí odkaz:
http://arxiv.org/abs/1610.08200
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 a result of a rigidly defined service interface. The interface, which
Externí odkaz:
http://arxiv.org/abs/1601.03370
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 (KPN) is taken as a formal model of computation and a Message Definition
Externí odkaz:
http://arxiv.org/abs/1503.00622
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). As a coordination language S-Net achieves a near-complete separation of
Externí odkaz:
http://arxiv.org/abs/1305.7167
Autor:
Tveretina, Olga, Funke, Daniel
Publikováno v:
EPTCS 54, 2011, pp. 250-262
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 regions and a constant derivative assigned to each region in the partition,
Externí odkaz:
http://arxiv.org/abs/1106.1245
Publikováno v:
EPTCS 4, 2009, pp. 13-21
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 pigeonhole formula has an exponential size. Here we show that any arbitrary OBD
Externí odkaz:
http://arxiv.org/abs/0909.5038
Publikováno v:
In Information and Computation 2007 205(8):1188-1211
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.