A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. ... In this regard, the automata proposed in the present work can be seen, to some extent, as a generalization of finite automata to graphs. ... Chapter 3 Alternating Distributed Graph Automata In this chapter, we introduce the main variant of distributed graph automata investigated in this work, and examine some of their properties. ...arXiv:1404.6503v1 fatcat:oflqmcgf55gazpnnienzsdqy6u
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order ... As an application, we suggest how suitable graph automata might be useful in formal verification of distributed algorithms, using Floyd-Hoare logic. ... Their combined expertise was especially helpful for the part about verification of distributed algorithms. ...doi:10.1109/lics.2015.27 dblp:conf/lics/Reiter15 fatcat:bu53ore6lfewtd274d2tpfoxdm
We introduce a new automata-theoretic perspective for studying locally checkable graph problems. ... In many settings, a graph problem can be solved efficiently with a distributed or parallel algorithm if and only if it has a small locality. ... would like to thank Alkida Balliu, Sebastian Brandt, Laurent Feuilloley, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jara Uitto, and all participants of the Helsinki February Workshop 2018 on Theory of Distributed ...arXiv:2002.07659v3 fatcat:xdaidwalongedikwijzmejex3a
In this paper, an ingenious graph-like learning automata in which each task in the task graph is represented by a learning automaton tries to solve the multiprocessor task-scheduling problem in a collective ... Optimized task scheduling is one of the most important challenges in multiprocessor environments such as parallel and distributed systems. ... So, a graph of learning automata is generated regarding the given task-graph. ...doi:10.14257/ijgdc.2015.8.1.05 fatcat:njh677sgzber7oj5u2oc57v7eq
locality of Π, and construct an asymptotically optimal distributed algorithm for solving Π (in the usual LOCAL model of distributed computing). ... We study the following algorithm synthesis question: given the description of a locally checkable graph problem Π for paths or cycles, determine in which instances Π is solvable, determine what is the ... When we encounter a new graph problem Π that we would like to solve in a distributed or parallel setting, there are three basic questions we would like to answer: 1. ...doi:10.4230/lipics.disc.2020.41 dblp:conf/wdag/ChangSS20 fatcat:drb6jy2xsjexjbqbnwhcuswn5i
distribution functions of the weights associated with the edges of the graph are unknown. ... In this paper maximum clique in stochastic graph is first defined and then several learning automata-based algorithms are proposed for solving maximum clique problem in stochastic graph where the probability ... The proposed algorithm uses a distributed learning automata which is isomorphic to the input graph. ...doi:10.1142/s0218488515500014 fatcat:kshswhojbng4njqbo6qunadmem
In this paper, we propose a new recommendation algorithm based on a hybrid method of distributed learning automata and graph partitioning. ... The proposed method utilizes usage data and hyperlink graph of the web site. ... distributed learning automata and graph partitioning. ...doi:10.1109/his.2011.6122131 dblp:conf/his/MehrTHM11 fatcat:y5ur6k7k6zdurmx23w2mu273h4
2011 International Symposium on Artificial Intelligence and Signal Processing (AISP)
In this paper, we propose a new hybrid method of distributed learning automata and graph partitioning to determine similarity between web pages using the web usage data. ... algorithm performed on the graph of the web site. ... Paper  uses a distributed learning automata corresponding to communication graph documents in digital libraries. ...doi:10.1109/aisp.2011.5960971 fatcat:lrspcduhj5hfje6xm7fav4ptkq
Here, α denotes the arboricity of the graph, which is, roughly speaking, the edge-density of the densest subgraph. ... We present a constant-time randomized distributed algorithms in the congested clique model that computes an O(α)-vertex-coloring, with high probability. ... We assume that the graph G is known to the processors in a distributed fashion: each processor/node knows its own neighboring processors/nodes in G. ...doi:10.4230/lipics.icalp.2019.142 dblp:conf/icalp/GhaffariS19 fatcat:wwze4ixqnfhmnopzqz7hs5dpia
. • Groups can be seen as geometric objects (graphs): • Path in CG: Sequence of edges ~ Sequence generators. ... -Regular languages can be treated by finite state automata (fsa). These groups are called Automatic Groups -Many finite algebraic groups has a very compact fsa. ...doi:10.1109/icdcsw.2014.29 dblp:conf/icdcsw/CameloVFP14 fatcat:db4rq56wavcrrov3flwausfwxy
To deal with these problems, we introduce distributed port automata in this paper. ... We consider an encoding of the coordination language Reo and show a new result on compositionality of flattening for distributed graphs. ... Composing distributed port automata Our goal is to use double pushout graph transformation [CMR + 97] for realizing reconfigurations of connectors modeled using distributed port automata. ...doi:10.14279/tuj.eceasst.41.568.603 fatcat:nsx3hlxhyza73ha4thn4n5gzli
The automata for the task graph of Figure 1 appear in Figure 4 . ... Corollary 2 (Task Graph Scheduling and Timed Automata) The optimal task graph scheduling problem can be reduced to the problem of finding the shortest path in a timed automaton. ...doi:10.1109/ipdps.2003.1213431 dblp:conf/ipps/AbdeddaimKM03 fatcat:g45hy3bjl5bnhi5p7qu2p7lpai
Cellular Automata - Simplicity Behind Complexity
VEGF, PDGF-B, Angiopoeitin) that are distributed over the mesh. Graph of Cellular Automata is constructed over the regular mesh of cellular automata and represents vascular systems. ... Cells that belong to the graph are the source of nutrients from where they are distributed over the regular mesh of automata that represent peat bog. ... This chapter is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike-3.0 License, which permits use, distribution and reproduction for non-commercial purposes, provided ...doi:10.5772/16115 fatcat:uhut76tmozac7jyiltw5af4mf4
Automation and Remote Control
} —1. n- oc The given conditions can be reformulated as follows in the language of graph theory: The graph of strong connections of any m automata on any finite interval of time is, with overwhelming probability ... The opposite case, the absence of regularity in the graph of strong connections when, for any two given automata, the probability of the existence of a strong connection at any moment of time t converges ...
Analogously we define fuzzy w- pushdown automata and distributed fuzzy w-pushdown automata along with the different acceptance criteria and modes of accep- tance for the distributed case. ... We prove that distributed fuzzy w-finite state automata accept the same set of languages as fuzzy w-finite state automata. ...
« Previous Showing results 1 — 15 out of 28,992 results