A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Preventing glitches and short circuits in high-level self-timed chip specifications

2015
*
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015
*

For example,

doi:10.1145/2737924.2737967
dblp:conf/pldi/LongfieldNMT15
fatcat:sk2u5zewk5b3pkr5xvodja7hru
*two*processes sending*on*the same channel at the same time causes glitches and*short*circuits in the physical chip implementation. ... This analysis is sound, and is even complete for the common subset of CHP programs without data-sensitive*synchronization*. ...*algorithm*. ...##
###
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
[article]

2016
*
arXiv
*
pre-print

Our method is based

arXiv:1608.05327v1
fatcat:p7ozlf7ymvenxasck3x3pxpk2m
*on*a*short*counterexample property: if a distributed*algorithm*violates a temporal specification (in a fragment of LTL), then there is a counterexample whose length is bounded and independent ... We prove this property by (i) characterizing executions depending*on*the structure of the temporal formula, and (ii) using commutativity of transitions to accelerate and shorten executions. ... Representation of Distributed*Algorithms*Threshold*Automata*As internal representation in our tool, and in the theoretical work of this*paper*, we use threshold*automata*(TA) defined in [37] . ...##
###
Spatiotemporal enabled Content-based Image Retrieval

2016
*
International Conference on GIScience Short Paper Proceedings
*

optimization

doi:10.21433/b311729295dw
fatcat:fulw4pw3kfh5nmfzcsy3pkisvm
*algorithms*. ...*One*of the key issues of all deployment optimization*algorithms*is accurate estimation of the coverage of an individual sensor. ... Acknowledgements The work presented in this*paper*is initiated at the request of several governmental institutions in Flanders, Belgium. ...##
###
New Algorithms For Finding Short Reset Sequences In Synchronizing Automata

2007
*
Zenodo
*

*Problem*of finding the shortest

*synchronizing*sequence is NP-hard, so polynomial

*algorithms*probably can work only as heuristic

*ones*. ... In this

*paper*we propose

*two*versions of polynomial

*algorithms*which work better than well-known Eppstein-s Greedy and Cycle

*algorithms*. ... CONCLUSION AND FUTURE WORK We presented

*two*new

*algorithms*for finding possibly the shortest

*synchronizing*words for

*synchronizing*

*automata*. ...

##
###
Complexity of Preimage Problems for Deterministic Finite Automata

2018
*
International Symposium on Mathematical Foundations of Computer Science
*

We focus

doi:10.4230/lipics.mfcs.2018.32
dblp:conf/mfcs/BerlinkovFS18
fatcat:ik37ji6e3feb3nvgz4ttirq7ay
*on*the most interesting cases that are the subclasses of strongly connected,*synchronizing*, and binary*automata*. ... We study the computational complexity of three*problems*related to the existence of words yielding certain preimages, which are especially motivated by the theory of*synchronizing**automata*. ... Bounded Length of the Word We also have the*two*variants of the above*problems*when an upper bound*on*the length of the word is additionally given.*Problem*13 (Extensible small subset by*short*word). ...##
###
Experiments with Synchronizing Automata
[chapter]

2016
*
Lecture Notes in Computer Science
*

We have improved an

doi:10.1007/978-3-319-40946-7_15
fatcat:w4tqaniirzeb3bwy3lt2uficwa
*algorithm*generating*synchronizing**automata*with a large length of the shortest reset words. ... This has been done by refining some known results concerning bounds*on*the reset length. ... of our*algorithm*. ...##
###
Taming Distributed Asynchronous Systems
[chapter]

2010
*
Lecture Notes in Computer Science
*

This extended abstract surveys some analysis techniques for distributed, asynchronous systems with

doi:10.1007/978-3-642-15375-4_4
fatcat:mohljlfywrhojojlp5spqpmyse
*two*kinds of*synchronization*, shared variables and fifo channels. ... Undecidability of various questions*about*communicating*automata*has actually*two*sources: the first, obvious*one*, is the unboundedness of channels. ... The second*paper*[26] shows decidability by restricting the plant: roughly speaking, the restriction requires that if*two*processes do not*synchronize*during a long amount of time, then they won't*synchronize*...##
###
Effective synchronizing algorithms

2012
*
Expert systems with applications
*

In this

doi:10.1016/j.eswa.2012.04.079
fatcat:o5eiggqrabd6ncid66b56zbyty
*paper*we analyze the*synchronizing**algorithms*described in the literature, both exact (with exponential runtime) and greedy (polynomial). ... The main*problem*in this approach is to find the shortest possible sequence which*synchronizes*the automaton being a model of the system under test. This can be done with a*synchronizing**algorithm*. ... There are*two*main*algorithmic**problems*in the*synchronization*theory: in the first*one*, given a*synchronizing*automaton A ¼ ðQ ; A; dÞ we ask*about*SSW for A. ...##
###
The firing squad synchronization problem on Cayley graphs

2000
*
Theoretical Computer Science
*

The ÿring squad

doi:10.1016/s0304-3975(00)00160-2
fatcat:a5zhwernd5cnfakwfzmmagkjym
*synchronization**problem*(FSSP for*short*) has been intensively studied in the*one*-dimensional space. The*problem*consists in the*synchronization*of a segment of*automata*. ... We generalize this*problem**on*Cayley graphs. ... Introduction Some recent*papers*study cellular*automata**on*Cayley graphs. This notion is a generalization of the classical*one*, where cellular*automata*are deÿned in the n-dimensional space Z n . ...##
###
Page 1776 of Mathematical Reviews Vol. 41, Issue 6
[page]

1971
*
Mathematical Reviews
*

The remaining

*papers*of Part I are devoted to applica- tions of the theory of*automata*to specific*problems*, for example, the allocation*problem*in compvter technology, the*problem*of*synchronization*in ... The remainder of Part III is devoted to Cetlin’s bibli- ography (56*papers*) and to*short**papers*by colleagues containing comments*on**problems*posed by the deceased or inspired by his work. ...##
###
A survey on some possibilities for applications of genetic algorithms in the automata theory

2016
*
Godisnjak Pedagoskog fakulteta u Vranju
*

The aim of this

doi:10.5937/gufv1607079b
fatcat:4gzvdjlonzarpm2lplutqp6oxu
*paper*was to further demonstrate the possibility of application of GA in the*Automata*theory. ... The reason is that genetic*algorithms*can be relatively easily adapted to the specific*problem*.*Automata*have already been constructed by evolutional techniques in 60's of last century by Fogel. ... In the*paper*(Kisielewicz et al., 2013)*on*present a new fast*algorithm*finding minimal reset words for finite*synchronizing**automata*. ...##
###
Page 2314 of Mathematical Reviews Vol. 48, Issue 6
[page]

1974
*
Mathematical Reviews
*

-1/(2] + (7)
then there are three stationary values of », namely } (unstable) and

*two*stable*ones*symmetric*about*4. ... The last chapter (Behavior of the systems of connected*automata*) studies the special*problems*of chain*synchronization*(like the “firing squad”’*problem*) and the calculation of the values of Boolean functions ...##
###
An Improved Algorithm for Finding the Shortest Synchronizing Words
[article]

2022
*
arXiv
*
pre-print

Finding a shortest or a

arXiv:2207.05495v1
fatcat:5egqgjvw7jd4vojzyitovg5iau
*short**synchronizing*word is a central computational*problem*in the theory of*synchronizing**automata*and is applied in other areas such as model-based testing and the theory of codes ... Because the*problem*of finding a shortest*synchronizing*word is computationally hard, among exact*algorithms*only exponential*ones*are known. ... The classical*synchronization**problem*is, for a given*synchronizing*automaton, to find a reset word. Preferably, this word should be as*short*as possible. ...##
###
P(l)aying for Synchronization
[chapter]

2012
*
Lecture Notes in Computer Science
*

Speaking

doi:10.1007/978-3-642-31606-7_14
fatcat:rfw5rnnkvjhmfi7nr5nubvngiu
*about**synchronization*costs, we consider deterministic*automata*in which each transition has a certain price. ...*Two*topics are presented:*synchronization*games and*synchronization*costs. In a*synchronization*game*on*a deterministic finite automaton, there are*two*players, Alice and Bob, whose moves alternate. ... To show that*Synchronizing**on*Budget is PSPACE-complete, we use a reduction from a*problem*concerning partial*automata*. ...##
###
P(L)AYING FOR SYNCHRONIZATION

2013
*
International Journal of Foundations of Computer Science
*

Speaking

doi:10.1142/s0129054113400170
fatcat:p6er4a5pmbdv5pw6i3oxfhj5te
*about**synchronization*costs, we consider deterministic*automata*in which each transition has a certain price. ...*Two*topics are presented:*synchronization*games and*synchronization*costs. In a*synchronization*game*on*a deterministic finite automaton, there are*two*players, Alice and Bob, whose moves alternate. ... As a synthesis of the*two*topics of this*paper*,*one*can consider*synchronization*games*on*DWAs where the aim of Alice is to minimize*synchronization*costs while Bob aims to prevent*synchronization*or at ...
« Previous

*Showing results 1 — 15 out of 6,345 results*