Analysis of parallel replicated simulations under a completion time constraint
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Model checking
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
The BlenX language: a tutorial
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Theoretical Computer Science
Hi-index | 0.00 |
Cells life follows a cycling behaviour which starts at cell birth and leads to cell division through a number of distinct phases. The transitions through the various cell cycle phases are controlled by a complex network of signalling pathways. Many cell cycle transitions are irreversible: once they are started they must reach completion. In this study we investigate the existence of conditions which lead to cases when irreversibility may be broken. Specifically, we characterise the elements of the cell cycle signalling network that are responsible for the irreversibility and we determine conditions for which the irreversible transitions may become reversible. We illustrate our results through a formal approach in which stochastic simulation analysis and model checking verification are combined. Through probabilistic model checking we provide a quantitative measure for the probability of irreversibility in the ''Start'' transition of the cell cycle.