Learning and designing stochastic processes from logical constraints

Authors:
Luca Bortolussi;Guido Sanguinetti
Affiliations:
Department of Mathematics and Geosciences, University of Trieste, Italy,CNR/ISTI, Pisa, Italy;School of Informatics, University of Edinburgh, UK,SynthSys, Centre for Synthetic and Systems Biology, University of Edinburgh, UK
Venue:
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Year:
2013

Citing 11
Cited 0

The benefits of relaxing punctuality

Journal of the ACM (JACM)
Model-Checking Algorithms for Continuous-Time Markov Chains

IEEE Transactions on Software Engineering
Probabilistic symbolic model checking with PRISM: a hybrid approach

International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)

Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
Pattern Recognition and Machine Learning (Information Science and Statistics)

Pattern Recognition and Machine Learning (Information Science and Statistics)
Statistical probabilistic model checking with a focus on time-bounded properties

Information and Computation
Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models

Journal of Computer and System Sciences
A Bayesian Approach to Model Checking Biological Systems

CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement

Theoretical Computer Science
Time-bounded verification of CTMCs against real-time specifications

FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Continuous time Markov Chains (CTMCs) are a convenient mathematical model for a broad range of natural and computer systems. As a result, they have received considerable attention in the theoretical computer science community, with many important techniques such as model checking being now mainstream. However, most methodologies start with an assumption of complete specification of the CTMC, in terms of both initial conditions and parameters. While this may be plausible in some cases (e.g. small scale engineered systems) it is certainly not valid nor desirable in many cases (e.g. biological systems), and it does not lead to a constructive approach to rational design of systems based on specific requirements. Here we consider the problems of learning and designing CTMCs from observations/ requirements formulated in terms of satisfaction of temporal logic formulae. We recast the problem in terms of learning and maximising an unknown function (the likelihood of the parameters) which can be numerically estimated at any value of the parameter space (at a non-negligible computational cost). We adapt a recently proposed, provably convergent global optimisation algorithm developed in the machine learning community, and demonstrate its efficacy on a number of non-trivial test cases.