“…The approach recently proposed to synthesize parameters using IC3 for reachability properties [11] looks promising; it would be interesting to investigate a combination of that work with a PRP-like procedure, especially if distributed.…”
The synthesis of timing parameters consists in deriving conditions on the timing constants of a concurrent system such that it meets its specification. Parametric timed automata are a powerful formalism for parameter synthesis, although most problems are undecidable. We first address here the following reachability preservation problem: given a reference parameter valuation and a (bad) control state, do there exist other parameter valuations that reach this control state iff the reference parameter valuation does? We show that this problem is undecidable, and introduce a procedure that outputs a possibly underapproximated answer. We then show that our procedure can efficiently replace the behavioral cartography to partition a bounded parameter subspace into good and bad subparts; furthermore, our procedure can even outperform the classical bad-state driven parameter synthesis semi-algorithm, especially when distributed on a cluster.
“…The approach recently proposed to synthesize parameters using IC3 for reachability properties [11] looks promising; it would be interesting to investigate a combination of that work with a PRP-like procedure, especially if distributed.…”
The synthesis of timing parameters consists in deriving conditions on the timing constants of a concurrent system such that it meets its specification. Parametric timed automata are a powerful formalism for parameter synthesis, although most problems are undecidable. We first address here the following reachability preservation problem: given a reference parameter valuation and a (bad) control state, do there exist other parameter valuations that reach this control state iff the reference parameter valuation does? We show that this problem is undecidable, and introduce a procedure that outputs a possibly underapproximated answer. We then show that our procedure can efficiently replace the behavioral cartography to partition a bounded parameter subspace into good and bad subparts; furthermore, our procedure can even outperform the classical bad-state driven parameter synthesis semi-algorithm, especially when distributed on a cluster.
“…We then carried out δ-reachability analysis to verify whether the invariants hold for each of the model candidates within a bounded time of 365 days. Here the treatment schedule threshold parameters were provided as ranges: r0 ∈ [0, 7.99] (ng ml −1 ) and r1 ∈ [8,15] (ng ml −1 ).…”
Section: Crc Proliferation Dynamicsmentioning
confidence: 99%
“…There exists various approaches for performing parameter synthesis through extra refinement on the reachable sets [10,2,12], but are restricted to dynamics that are much simpler than the models we encounter here. On the other hand, other SMT-based methods for hybrid systems [8,9], which can perform parameter synthesis in a similar manner, mostly focus on efficient handling of complex discrete transitions but are restricted to models with simpler continuous dynamics.…”
Recent clinical studies suggest that the efficacy of hormone therapy for prostate cancer depends on the characteristics of individual patients. In this paper, we develop a computational framework for identifying patient-specific androgen ablation therapy schedules for postponing the potential cancer relapse. We model the population dynamics of heterogeneous prostate cancer cells in response to androgen suppression as a nonlinear hybrid automaton. We estimate personalized kinetic parameters to characterize patients and employ δ-reachability analysis to predict patient-specific therapeutic strategies. The results show that our methods are promising and may lead to a prognostic tool for prostate cancer therapy.
“…Synthesis for parametric timed automata (PTA) has drawn considerable attention [1,19,20,26,17,14,15,2,3,25,12,7,10,18,21,13]. These approaches explore the global state space of all interacting components.…”
We address the problem of parameter synthesis for parametric timed systems (PTS). The motivation comes from industrial configuration problems for production lines. Our method consists in compositionally generating over-approximations for the individual components of the input systems, which are translated, together with global properties, to ∃∀SMT problems. Our translation forms the basis for optimised and robust parameter synthesis for slightly richer models than PTS. Work supported by the European projects BEinCPPS, CPSE-labs and OpenMOS.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.