Results 1 - 10
of
341
Abstractions for network update
- In ACM SIGCOMM’12
, 2012
"... Configuration changes are a common source of instability in networks, leading to outages, performance disruptions, and security vulnerabilities. Even when the initial and final configurations are correct, the update process itself often steps through intermediate configurations that exhibit incorrec ..."
Abstract
-
Cited by 138 (20 self)
- Add to MetaCart
(Show Context)
Configuration changes are a common source of instability in networks, leading to outages, performance disruptions, and security vulnerabilities. Even when the initial and final configurations are correct, the update process itself often steps through intermediate configurations that exhibit incorrect behaviors. This paper introduces the notion of consistent network updates—updates that are guaranteed to preserve well-defined behaviors when transitioning between configurations. We identify two distinct consistency levels, per-packet and per-flow, and we present general mechanisms for implementing them in Software-Defined Networks using switch APIs like OpenFlow. We develop a formal model of OpenFlow networks, and prove that consistent updates preserve a large class of properties. We describe our prototype implementation, including several optimizations that reduce the overhead required to perform consistent updates. We present a verification tool that leverages consistent updates to significantly reduce the complexity of checking the correctness of network control software. Finally, we describe the results of some simple experiments demonstrating the effectiveness of these optimizations on example applications.
Validation of qualitative models of genetic regulatory networks by model checking: Analysis of the nutritional stress response in Escherichia coli
- Bioinformatics
, 2005
"... The functioning and development of living organisms is controlled by large and complex networks of genes, proteins, small molecules, and their mutual interactions, so-called genetic regulatory networks. In order to gain an understanding of how the behavior of an organism – e.g., the response of a ..."
Abstract
-
Cited by 85 (18 self)
- Add to MetaCart
(Show Context)
The functioning and development of living organisms is controlled by large and complex networks of genes, proteins, small molecules, and their mutual interactions, so-called genetic regulatory networks. In order to gain an understanding of how the behavior of an organism – e.g., the response of a
Modeling and Querying Biomolecular Interaction Networks
- Theoretical Computer Science
, 2003
"... We introduce a formalism to represent and analyze protein-protein and protein-DNA interaction networks. We illustrate the expressivity of this language, by proposing a formal counterpart of Kohn's compilation on the mammalian cell cycle control. This e#ectively turns an otherwise static kno ..."
Abstract
-
Cited by 82 (0 self)
- Add to MetaCart
We introduce a formalism to represent and analyze protein-protein and protein-DNA interaction networks. We illustrate the expressivity of this language, by proposing a formal counterpart of Kohn's compilation on the mammalian cell cycle control. This e#ectively turns an otherwise static knowledge into a discrete transition system incorporating a qualitative description of the dynamics. We then propose to use the Computation Tree Logic CTL as a query language for querying the possible behaviours of the system. We provide examples of biologically relevant queries expressed in CTL about the mammalian cell cycle control and show the e#ectiveness of symbolic model checking tools to evaluate CTL queries in this context.
Modelling and querying interaction networks in the biochemical abstract machine biocham
- Journal of Biological Physics and Chemistry
, 2004
"... Recent progress in high-throughput data-production technologies pushes research toward systems biology, focusing on the global interaction between the components of biomolecular processes. In this article we present a formal modelling environment for ..."
Abstract
-
Cited by 79 (27 self)
- Add to MetaCart
(Show Context)
Recent progress in high-throughput data-production technologies pushes research toward systems biology, focusing on the global interaction between the components of biomolecular processes. In this article we present a formal modelling environment for
Symbolic model checking of biochemical networks
- Computational Methods in Systems Biology (CMSB’03), volume 2602 of LNCS
, 2003
"... Abstract. Model checking is an automatic method for deciding if a circuit or a program, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic such as CTL. In this paper we argue that symbolic model checking is feasible in systems biology and that it ..."
Abstract
-
Cited by 66 (8 self)
- Add to MetaCart
Abstract. Model checking is an automatic method for deciding if a circuit or a program, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic such as CTL. In this paper we argue that symbolic model checking is feasible in systems biology and that it shows some advantages over simulation for querying and validating formal models of biological processes. We report our experiments on using the symbolic model checker NuSMV and the constraint-based model checker DMC, for the modeling and querying of two biological processes: a qualitative model of the mammalian cell cycle control after Kohn's diagrams, and a quantitative model of gene expression regulation. 1 Introduction In recent years, Biology has clearly engaged an elucidation work of high-level biological processes in terms of their biochemical basis at the molecular level. The mass production of post genomic data, such as ARN expression, protein production and protein-protein interaction, raises the need of a strong parallel effort on the formal representation of biological processes. Metabolism networks, extracellular and intracellular signaling pathways, and gene expression regulation networks, are very complex dynamical systems. Annotating data bases with qualitative and quantitative information about the dynamics of biological systems, will not be sufficient to integrate and efficiently use the current knowledge about these systems. The design of formal tools for modeling biomolecular processes and for reasoning about their dynamics seems to be a mandatory research path to which the field of formal verification in computer science may contribute a lot.
A static compliance-checking framework for business process models
, 2007
"... Regulatory compliance of business operations is a critical problem for enterprises. As enterprises increasingly use business process management systems to automate their business processes, technologies to automatically check the compliance of process models against compliance rules are becoming im ..."
Abstract
-
Cited by 64 (0 self)
- Add to MetaCart
Regulatory compliance of business operations is a critical problem for enterprises. As enterprises increasingly use business process management systems to automate their business processes, technologies to automatically check the compliance of process models against compliance rules are becoming important. In this paper, we present a method to improve the reliability and minimize the risk of failure of business process management systems from a compliance perspective. The proposed method allows separate modeling of both process models and compliance concerns. Business process models expressed in the Business Process Execution Language are transformed into pi-calculus and then into finite state machines. Compliance rules captured in the graphical Business Property Specification Language are translated into linear temporal logic. Thus, process models can be verified against these compliance rules by means of model-checking technology. The benefit of our method is threefold: Through the automated verification of a large set of business process models, our approach increases deployment efficiency and lowers the risk of installing noncompliant processes; it reduces the cost associated with inspecting business process models for compliance; and compliance checking may ensure compliance of new process models before their execution and thereby increase the reliability of business operations in general.
Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
- Journal of Applied Logic
"... checking via ordered binary decision diagrams ..."
(Show Context)
Temporal logic motion planning for mobile robots
- In Proceedings of the 2005 IEEE International Conference on Robotics and Automation
, 2005
"... Abstract — In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot specifications such as reaching a goal or avoiding an obstacle, but also more sophisticated specifications such ..."
Abstract
-
Cited by 53 (10 self)
- Add to MetaCart
(Show Context)
Abstract — In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot specifications such as reaching a goal or avoiding an obstacle, but also more sophisticated specifications such as sequencing, coverage, or temporal ordering of different tasks. In order to provide computational solutions to this problem, we first construct discrete abstractions of robot motion based on some environmental decomposition. We then generate discrete plans satisfying the temporal logic formula using powerful model checking tools, and finally translate the discrete plans to continuous trajectories using hybrid control. Critical to our approach is providing formal guarantees ensuring that if the discrete plan satisfies the temporal logic formula, then the continuous motion also satisfies the exact same formula. Index Terms — Motion planning, temporal logics, model checking, discrete abstractions, hybrid control. I.
Model Checking Genetic Regulatory Networks using GNA and CADP
- In: Proceedings of the 11th International SPIN Workshop on Model Checking of Software SPIN’2004
, 2004
"... who are interested in the interdisciplinary methods and applications relevant to the analysis, design and management of complex systems. 15 St. Mary’s St. Brookline MA 02446 l 617.358.1295 l www.bu.edu/systems ..."
Abstract
-
Cited by 45 (6 self)
- Add to MetaCart
(Show Context)
who are interested in the interdisciplinary methods and applications relevant to the analysis, design and management of complex systems. 15 St. Mary’s St. Brookline MA 02446 l 617.358.1295 l www.bu.edu/systems
S.: Model Checking of Domain Artifacts in Product Line Engineering
- In: Proceedings 24th International Conference on Automated Software Engineering (ASE 2009
, 2009
"... Abstract — In product line engineering individual products are derived from the domain artifacts of the product line. The reuse of the domain artifacts is constraint by the product line variability. Since domain artifacts are reused in several products, product line engineering benefits from the ver ..."
Abstract
-
Cited by 39 (0 self)
- Add to MetaCart
(Show Context)
Abstract — In product line engineering individual products are derived from the domain artifacts of the product line. The reuse of the domain artifacts is constraint by the product line variability. Since domain artifacts are reused in several products, product line engineering benefits from the verification of domain artifacts. For verifying development artifacts, model checking is a well-established technique in single system development. However, existing model checking approaches do not incorporate the product line variability and are hence of limited use for verifying domain artifacts. In this paper we present an extended model checking approach which takes the product line variability into account when verifying domain artifacts. Our approach is thus able to verify that every permissible product (specified with I/O-automata) which can be derived from the product line fulfills the specified properties (specified with CTL). Moreover, we use two examples to validate the applicability of our approach and report on the preliminary validation results.
