A Formal Methods Approach to Pattern Recognition and Synthesis in Reaction Diffusion Networks

Date

2018-03-01

Author

Bartocci, Ezio
Aydın Göl, Ebru
Haghighi, Iman
Belta, Calin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

211
views

0
downloads

We introduce a formal framework for specifying, detecting, and generating spatial patterns in reaction diffusion networks. Our approach is based on a novel spatial superposition logic, whose semantics is defined over the quad-tree representation of a partitioned image. We demonstrate how to use rule-based classifiers to efficiently learn spatial superposition logic formulas for several types of patterns from positive and negative examples. We implement pattern detection as a model-checking algorithm and we show that it achieves very good results on test data sets which are different from the training sets. We provide a quantitative semantics for our logic and we develop computational framework where our quantitative model-checking algorithm works in synergy with a particle swarm optimization technique to synthesize the parameters leading to the formation of desired patterns in reaction diffusion networks.

Subject Keywords

Formal verification and synthesis, Pattern recognition and formation, Reaction diffusion networks

URI

https://hdl.handle.net/11511/33183

Journal

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS

DOI

https://doi.org/10.1109/tcns.2016.2609138

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

A formal methods approach to pattern synthesis in reaction diffusion systems Aydın Göl, Ebru; Belta, Calin (2015-02-12) We propose a technique to detect and generate patterns in a network of locally interacting dynamical systems. Central to our approach is a novel spatial superposition logic, whose semantics is defined over the quad-tree of a partitioned image. We show that formulas in this logic can be efficiently learned from positive and negative examples of several types of patterns. We also demonstrate that pattern detection, which is implemented as a model checking algorithm, performs very well for test data sets diffe...
A computational model of social dynamics of musical agreement Öztürel, İsmet Adnan; Bozşahin, Hüseyin Cem; Department of Cognitive Sciences (2011) Semiotic dynamics and computational evolutionary musicology literature investigate emergence and evolution of linguistic and musical conventions by using computational multi-agent complex adaptive system models. This thesis proposes a new computational evolutionary musicology model, by altering previous models of familiarity based musical interactions that try to capture evolution of songs as a co-evolutionary process through mate selection. The proposed modified familiarity game models a closed community o...
An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks Deniz, Fatih; Bagci, Hakki; KÖRPEOĞLU, İBRAHİM; Yazıcı, Adnan (2016-07-01) This paper introduces an adaptive, energy-aware and distributed fault-tolerant topology control algorithm, namely the Adaptive Disjoint Path Vector (ADPV) algorithm, for heterogeneous wireless sensor networks. In this heterogeneous model, we have resource-rich supernodes as well as ordinary sensor nodes that are supposed to be connected to the supernodes. Unlike the static alternative Disjoint Path Vector (DPV) algorithm, the focus of ADPV is to secure supernode connectivity in the presence of node failures...
A Divide and Conquer Approach for Construction of Large-Scale Signaling Networks from PPI and RNAi Data Using Linear Programming Ozsoy, Oyku Eren; Can, Tolga (Institute of Electrical and Electronics Engineers (IEEE), 2013-07-01) Inference of topology of signaling networks from perturbation experiments is a challenging problem. Recently, the inference problem has been formulated as a reference network editing problem and it has been shown that finding the minimum number of edit operations on a reference network to comply with perturbation experiments is an NP-complete problem. In this paper, we propose an integer linear optimization (ILP) model for reconstruction of signaling networks from RNAi data and a reference network. The ILP ...
A new real-time suboptimum filtering and prediction scheme for general nonlinear discrete dynamic systems with Gaussian or non-Gaussian noise Demirbaş, Kerim (Informa UK Limited, 2011-01-01) A new suboptimum state filtering and prediction scheme is proposed for nonlinear discrete dynamic systems with Gaussian or non-Gaussian disturbance and observation noises. This scheme is an online estimation scheme for real-time applications. Furthermore, this scheme is very suitable for state estimation under either constraints imposed on estimates or missing observations. State and observation models can be any nonlinear functions of the states, disturbance and observation noises as long as noise samples ...

Citation Formats

E. Bartocci, E. Aydın Göl, I. Haghighi, and C. Belta, “A Formal Methods Approach to Pattern Recognition and Synthesis in Reaction Diffusion Networks,” IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, pp. 308–320, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33183.