A symbolic algorithm for lazy synthesis of eager strategies

2019 ◽  
Vol 57 (1-2) ◽  
pp. 81-106
Author(s):  
Swen Jacobs ◽  
Mouhammad Sakr
Keyword(s):  
Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 560 ◽  
Author(s):  
Luboš Brim ◽  
Samuel Pastva ◽  
David Šafránek ◽  
Eva Šmijáková

Boolean network (BN) is a simple model widely used to study complex dynamic behaviour of biological systems. Nonetheless, it might be difficult to gather enough data to precisely capture the behavior of a biological system into a set of Boolean functions. These issues can be dealt with to some extent using parametrised Boolean networks (ParBNs), as this model allows leaving some update functions unspecified. In our work, we attack the control problem for ParBNs with asynchronous semantics. While there is an extensive work on controlling BNs without parameters, the problem of control for ParBNs has not been in fact addressed yet. The goal of control is to ensure the stabilisation of a system in a given state using as few interventions as possible. There are many ways to control BN dynamics. Here, we consider the one-step approach in which the system is instantaneously perturbed out of its actual state. A naïve approach to handle control of ParBNs is using parameter scan and solve the control problem for each parameter valuation separately using known techniques for non-parametrised BNs. This approach is however highly inefficient as the parameter space of ParBNs grows doubly exponentially in the worst case. We propose a novel semi-symbolic algorithm for the one-step control problem of ParBNs, that builds on symbolic data structures to avoid scanning individual parameters. We evaluate the performance of our approach on real biological models.


2018 ◽  
Vol 18 (4) ◽  
pp. 703-715 ◽  
Author(s):  
Volodymyr Makarov ◽  
Nataliia Romaniuk

AbstractA new symbolic algorithmic implementation of the general scheme of the exponentially convergent functional-discrete method is developed and justified for the Sturm–Liouville problem on a finite interval for the Schrödinger equation with a polynomial potential and the boundary conditions of Dirichlet type. The algorithm of the general scheme of our method is developed when the potential function is approximated by the piecewise-constant function. Our algorithm is symbolic and operates with the decomposition coefficients of the eigenfunction corrections in some basis. The number of summands in these decompositions depends on the degree of the potential polynomial and on the correction number. Our method uses the algebraic operations only and does not need solutions of any boundary value problems and computations of any integrals unlike the previous version. A numerical example illustrates the theoretical results.


Author(s):  
A. Deveikis ◽  
A. A. Gusev ◽  
V. P. Gerdt ◽  
S. I. Vinitsky ◽  
A. Góźdź ◽  
...  
Keyword(s):  

Biometrika ◽  
1993 ◽  
Vol 80 (4) ◽  
pp. 715-730 ◽  
Author(s):  
JAMES E. STAFFORD ◽  
DAVID F. ANDREWS

2012 ◽  
Vol 63 (2) ◽  
pp. 357-367 ◽  
Author(s):  
Ji-Teng Jia ◽  
Yao-Lin Jiang

Sign in / Sign up

Export Citation Format

Share Document