78 search results - page 1 / 16 » State-space analysis of Boolean networks |
TNN
2010
13 years 5 months ago
2010
This paper provides a comprehensive framework for the state space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor produ...
AUTOMATICA
2010
13 years 11 months ago
2010
Based on the linear expression of the dynamics of Boolean networks, the coordinate transformation of Boolean variables is defined. It follows that the state space coordinate trans...
ICDCS
2007
IEEE
2007
IEEE
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
14 years 5 months ago
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
ENTCS
2007
13 years 11 months ago
2007
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a f...
INFORMS
1998
13 years 10 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...