212
click to vote
CMSB
15 years 11 months ago
2006 Springer 
Genetic regulatory networks have been modeled as discrete transition systems by many approaches, benefiting from a large number of formal verification algorithms available for the ...
214
click to vote
CMSB
15 years 11 months ago
2006 Springer 
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
200
Voted
CMSB
15 years 11 months ago
2006 Springer 
Abstract. This paper presents a method for regulatory network reconstruction from experimental data. We propose a mathematical model for regulatory interactions, based on the work ...
217
Voted
CMSB
15 years 11 months ago
2006 Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
218
Voted
CMSB
15 years 11 months ago
2006 Springer
We present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. Rewriting game theory is discrete and comes with a graph...
|
Applied Computing