Concurrent constraint programming
Concurrent constraint programming
Information Processing Letters
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
Fluid Flow Approximation of PEPA models
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps
BIBM '07 Proceedings of the 2007 IEEE International Conference on Bioinformatics and Biomedicine
Robustness analysis and tuning of synthetic gene networks
Bioinformatics
Relating continuous and discrete PEPA models of signalling pathways
Theoretical Computer Science
On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid systems and biology: continuous and discrete modeling for systems biology
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
Transactions on Computational Systems Biology VII
Limit behavior of the hybrid approximation of stochastic process algebras
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
A semantic equivalence for Bio-PEPA based on discretisation of continuous values
Theoretical Computer Science
Simulation techniques for the calculus of wrapped compartments
Theoretical Computer Science
Multiple verification in complex biological systems: the bone remodelling case study
Transactions on Computational Systems Biology XIV
Hi-index | 5.23 |
We provide Stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra based on CCP, with a semantics in terms of hybrid automata. We associate with each sCCP program both a stochastic and a non-deterministic hybrid automaton. Then, we compare such automata with the standard stochastic semantics (given by a Continuous Time Markov Chain) and the one based on ordinary differential equations, obtained by a fluid-flow approximation technique. We discuss in detail two case studies: Repressilator and the Circadian Clock, with particular regard to the robustness exhibited by the different semantic models and to the effect of discreteness in dynamical evolution of such systems.