A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Counting symbol switches in synchronizing automata
[article]
2018
arXiv
pre-print
Preserved Fulltext
Where the synchronizing words of the Černý automata C_n have switch count linear in n, we wonder whether synchronizing automata exist for which every synchronizing word has quadratic switch count. ...
We give some series of synchronizing automata yielding quadratic switch count, the best one reaching 2/3 n^2 + O(n) as switch count. ...
Restricting to binary automata A first idea to find automata on two symbols with a high switch count is to take the automata P n or variants, and identify many of the symbols. ...
arXiv:1812.04050v1
fatcat:3n3vcp2xyvhizd2pbzud4tqyga
An Optimized Counter Design using T Flip-Flop in Quantum-Dot Cellular Automata Technology
2019
International journal of recent technology and engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The paper also present the use of proposed T flip flop designed with 3 input XOR gate in designing not only synchronous binary up counters but also in synchronous binary down counter provides a significant ...
, faster switching speed and extremely density structure . ...
QCA majority gate layout and its logic symbol are shown in Fig. 2(a) and Fig.2(b). ...
doi:10.35940/ijrte.b1332.0982s1119
fatcat:kyhpbzwk35dbhdiesptkn3rsha
The size of power automata
2003
Theoretical Computer Science
Preserved Fulltext
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 application/pdf.
We comment on the application of these results to the study of cellular automata. ...
For arbitrary semiautomata we show that it is PSPACE-complete to decide whether the size of the accessible part of their power automata exceeds a given bound. ...
The anonymous referees have helped greatly in improving the presentation of the results. ...
doi:10.1016/s0304-3975(02)00413-9
fatcat:j355w5x5fvbcjdfew2y6gcjhsy
Checking Equivalence for Reo Networks
2008
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
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 application/pdf.
Using a special operator on our symbolic data structure enables efficient treatment of the rich labeled transitions in constraint automata. ...
We present a compositional approach for the generation of a symbolic representation of constraint automata for Reo networks and report on an implementation that realizes a partitioning splitter technique ...
One can count the number of symbolic operations but the OBDDs this operations work on can have exponential size in the number of variables. ...
doi:10.1016/j.entcs.2008.06.029
fatcat:ch6tokqufvhetfx37ssrdg5jwa
Asynchronously Communicating Visibly Pushdown Systems
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our model generalizes previously proposed models that have decidable reachability in several ways. ...
, and (3) the relations formed by tuples of such languages to be synchronized, which permits modeling of complex interactions among processes. ...
Such automata move all their tape heads synchronously in lock-step, as if it is a single head reading a tuple of symbols. ...
doi:10.1007/978-3-642-38592-6_16
fatcat:7dyumv5k6fhbtbbwkawlbpx5ci
The Semantics and Tool Support of OZTA
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we firstly enhance OZTA, a combination of Object-Z and Timed Automata, by introducing a set of timed patterns as language constructs that can specify the dynamic and timing features of complex ...
real-time systems in a systematic way. ...
automata must synchronize on these switches, as illustrated in Figure 5 (1). ...
doi:10.1007/11576280_6
fatcat:rufcyazq2ndtnkhbu3azeyjga4
Abductive learning of quantized stochastic processes with probabilistic finite automata
2012
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
Preserved Fulltext
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 application/pdf.
(Online version in colour.) Definition 2.13 (symbolic count function). For a string s over Σ, the count function # s : Σ → N ∪ {0} counts the number of times a particular substring occurs in s. ...
Switching between these repeating distributions on right concatenation of symbols induces the structure shown in figure 8d for = 0.05 (see §3a). ...
doi:10.1098/rsta.2011.0543
pmid:23277601
fatcat:zpq2746cnrez7lphnak2prylla
Automata and Fixpoints for Asynchronous Hyperproperties
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Past approaches have focussed on synchronous analyses, i.e. techniques in which different paths are compared lockstepwise. ...
In this paper, we systematically study asynchronous analyses for hyperproperties by introducing both a novel automata model (Alternating Asynchronous Parity Automata) and the temporal fixpoint calculus ...
Here, we cannot count the index of a symbol in the word in the state space since that would increase the AAPA's size beyond polynomial. ...
arXiv:2010.11605v1
fatcat:hi2hr2ghibhf7ibff255sxnnba
Automata Processor Architecture and Applications: A Survey
2016
International Journal of Grid and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a survey of the state-of-the-art in automata processor based hardware accelerators. ...
in this increasingly important area of automata computing paradigm. ...
For example, automata that count the three occurrences of character "A" before a final character "T" is shown in Figure 3 . ...
doi:10.14257/ijgdc.2016.9.4.05
fatcat:stay6tyhrzgdhfn4ptnv56oxq4
Verification in loosely synchronous queue-connected discrete timed automata
2003
Theoretical Computer Science
Preserved Fulltext
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 application/pdf.
W and R do not share a global clock and operate in a loosely synchronous way. ...
We then present some properties (e.g., safety, invariance, etc.) that can be veriÿed for loosely synchronous queue-connected discrete timed automata and give an example of a system composed of a sensor ...
We use a count variable # ( w ) to denote the number of occurrences of a symbol ∈ in the content of the queue. ...
doi:10.1016/s0304-3975(02)00076-2
fatcat:pxqdi4dkz5e77nlqkoqcnjxo4e
Continuous-Time Models for System Design and Analysis
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. ...
We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. ...
This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). ...
doi:10.1007/978-3-319-91908-9_22
fatcat:xv76tvohyrbyfb4iac5qdye6ca
Subset Synchronization and Careful Synchronization of Binary Finite Automata
[article]
2016
arXiv
pre-print
Preserved Fulltext
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 application/pdf.
Other Versions
We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial ...
The results apply also to the corresponding thresholds in two more general settings: D1- and D3-directable nondeterministic automata and composition sequences over finite domains. ...
We are going to show that in fact during the synchronization of S the switches together perform a binary counting from 0 (all the switches set to 0) to 2 m − 1 (all the switches set to 1). ...
arXiv:1403.3972v4
fatcat:eg2bbh6oivcafkkxoxzj6ic3ky
Automata modeling of Quorum Sensing for nanocommunication networks
2011
Nano Communication Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
However, synchronization may be required to build a network architecture. In this work, we propose Quorum Sensing as a novel way to achieve synchronization between nodes of a nanonetwork. ...
This model serves as the control unit of a "quorum nanomachine", which would be able to synchronize with its fellows in a distributed manner by means of molecular communication. ...
Also, a solution based on cellular automata and the classical ''firing squad problem'' [23, 22] would be unfeasible because synchronization between neighboring nodes is needed in the first place. ...
doi:10.1016/j.nancom.2011.04.004
fatcat:2jdgeddyyvhj7jaroacnnmppfm
Subset Synchronization and Careful Synchronization of Binary Finite Automata
2016
International Journal of Foundations of Computer Science
Preserved Fulltext
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 application/pdf.
We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial ...
The results apply also to the corresponding thresholds in two more general settings: D1-and D3-directable nondeterministic automata and composition sequences over finite domains. ...
We are going to show that in fact during the synchronization of S the switches together perform a binary counting from 0 (all the switches set to 0) to 2 m − 1 (all the switches set to 1). ...
doi:10.1142/s0129054116500167
fatcat:6vsnh7chtrenviw72e4x5nxhxq
Computational Complexity of Synchronization under Regular Constraints
2019
International Symposium on Mathematical Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Many variations of synchronization of finite automata have been studied in the previous decades. ...
In addition, we characterize constraint automata with arbitrarily many states for which the constrained synchronization problem is polynomial-time solvable. ...
In its simplest form, the switching between "normal mode" and "directive" (synchronization) mode can be modeled as ab * a. This scenario produces an NP-complete synchronization problem. ...
doi:10.4230/lipics.mfcs.2019.63
dblp:conf/mfcs/FernauGHHVW19
fatcat:2mdtzpytebduhesbhhibrolscm
« Previous
Showing results 1 — 15 out of 2,055 results