CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Model checking
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
Model checking genetic regulatory networks with parameter uncertainty
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Model checking LTL over controllable linear systems is decidable
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
A fully automated framework for control of linear systems from LTL specifications
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Comparison of four procedures for the identification of hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Brief Equivalence of hybrid dynamical models
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
On Parameter Synthesis by Parallel Model Checking
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
In this paper, we consider discrete-time continuous-space Piecewise Affine (PWA) systems with parameter uncertainties, and study temporal logic properties of their trajectories. Specifically, given a PWA system with polytopal parameter uncertainties, and a Linear Temporal Logic (LTL) formula over linear predicates in the states of the system, we attempt to find subsets of parameters guaranteeing the satisfaction of the formula by all trajectories of the system. We illustrate our method by applying it to a PWA model of a two-gene network.