Name
Abstract | ||
|---|---|---|
The modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system, and a parametrisation from which can be derived a discrete transition system. Given the influence graph only, the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.tcs.2018.03.009 | Theoretical Computer Science |
Keywords | Field | DocType |
Boolean networks,Thomas networks,Parametrised discrete dynamics,Asynchronous systems,Concurrency,Systems biology | Transition system,Discrete mathematics,Observability,Concurrency,Infimum and supremum,Theoretical computer science,Reachability,Parameter space,Boolean algebra,State space,Mathematics | Journal |
Volume | ISSN | Citations |
765 | 0304-3975 | 1 |
PageRank | References | Authors |
0.37 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juraj Kolčák | 1 | 10 | 2.00 |
| David Safránek | 2 | 84 | 15.91 |
| Stefan Haar | 3 | 85 | 14.63 |
| Loïc Paulevé | 4 | 204 | 18.68 |