Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 1,084 papers for “Nondeterministic algorithm”
Mika Göös, Jukka Suomela · Työväentutkimus Vuosikirja · 2011
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes instance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constant-time distributed algorithm.
Cited by 54Open access
Parosh Aziz Abdulla, et al. · 2008
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize nondeterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of O(^r m log n), where ^r is the maximum rank of the input alphabet, m is the total size of the transition table, and n is the number of states.
Cited by 0
Hsueh‐Ting Chu, Chaur-Chin Chen · 2002
With iterated function systems (IFS), there are two classical algorithms of generating artificial fractal pictures: the deterministic algorithm and the random iteration algorithm. The deterministic algorithm spends huge computations on checking convergence iteratively. On the other hand, the random iteration algorithm is nondeterministic and time consuming. People seldom check convergence by the algorithm. Moreover, many pixels in the picture are computed again and again by both of the algorithms. Thus a new algorithm is given. The algorithm promises convergence without iterative checks. Also, our algorithm runs faster than the existing algorithms do on a large scale.
Cited by 6
Jyoti Has, Himani Mannan, B Aouni et al. · 2015
Today, analysts face optimization problems with a set of objectives, often inconsistent with each other. Multiobjective Goal Programming algorithm plays an important role in dealing with these real world problems involving nondeterministic systems for which multiple and conflicting objectives exist. In this paper we will study Multi-Objective Goal Programming algorithm, its history, current methods for solving multi-objective problems and its various applications.
Cited by 0Open access
Marc Bagnol, Denis Kuperberg · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018
Good-for-Games (GFG) automata offer a compromise between deterministic and nondeterministic automata. They can resolve nondeterministic choices in a step-by-step fashion, without needing any information about the remaining suffix of the word. These automata can be used to solve games with omega-regular conditions, and in particular were introduced as a tool to solve Church's synthesis problem. We focus here on the problem of recognizing Büchi GFG automata, that we call Büchi GFGness problem: given a nondeterministic Büchi automaton, is it GFG? We show that this problem can be decided in P, and more precisely in O(n^4m^2|Sigma|^2), where n is the number of states, m the number of transitions and |Sigma| is the size of the alphabet. We conjecture that a very similar algorithm solves the problem in polynomial time for any fixed parity acceptance condition.
Cited by 15Open access
2008
Communicated by Editor’s name We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize nondeterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of O(ˆr m log n), where ˆÖis the maximum rank of any symbol in the input alphabet,Ñis the total size of the transition table, andÒis the number of states.
Cited by 0
Minrui Fei, Dajun Du, Li, Kang · Research Portal (Queen's University Belfast) · 2008
Most control strategies for networked control system (NCS) assume that system model is known as 'a priori', which are however impractical in many industrial applications. To obtain a suitable model for networked control, this paper concentrates on model identification under the networked control environment. A networked identification scheme is proposed here, and nondeterministic factors such as network-induced delay, data packet out-of-order, and data packet loss between the sensor and identifier as well as the identifier and the actuator are considered. A discard-packet strategy is first developed to deal with network nondeterministic factors from the sensor to the identifier, and a cubic spline interpolation is used to compensate lost data. Actuator buffers are then introduced for actuator nodes to handle network nondeterministic factors between the identifier and the actuator. Finally, a fast recursive algorithm is used both to select the model structure and to estimate the unknown system parameters. Experiments on ARMA model identification and NARMAX model identification are performed respectively under different network loads. Simulation results show that the proposed networked identification scheme can effectively overcome the impact of various network-induced nondeterministic factors and significantly improve model identification performance.
Cited by 0
Anh Vo, Ganesh Gopalakrishnan, Robert M. Kirby et al. · 2011
We propose a dynamic verification approach for large-scale message passing programs to locate correctness bugs caused by unforeseen nondeterministic interactions. This approach hinges on an efficient protocol to track the causality between nondeterministic message receive operations and potentially matching send operations. We show that causality tracking protocols that rely solely on logical clocks fail to capture all nuances of MPI program behavior, including the variety of ways in which nonblocking calls can complete. Our approach is hinged on formally defining the matches-before relation underlying the MPI standard, and devising lazy update logical clock based algorithms that can correctly discover all potential outcomes of nondeterministic receives in practice. can achieve the same coverage as a vector clock based algorithm while maintaining good scalability. LLCP allows us to analyze realistic MPI programs involving a thousand MPI processes, incurring only modest overheads in terms of communication bandwidth, latency, and memory consumption.
Cited by 19
WANG Wei1, DU Cui-lan2, ZHANG Hong-li1 · SHILAP Revista de lepidopterología · 2006
Orienting to difficulty of testing nondeterministic parallel programs,the relationship between message-passing behavior and network performance constraint in grid environment was analyzed,and a new limited reachability testing algorithm was proposed,which was called reachability testing algorithm with network performance constraint,based on classic reachability algorithm.This algorithm only tested those execution paths with high happening possibility,which can reduce the number of those paths to be tested.The testing efficiency is improved,and the testing completeness is held reasonably.
Cited by 0Open access
В. Н. Лебедев · Computational Mathematics and Mathematical Physics · 2016
This paper is devoted to solving certain problems on the computational complexity of deciding the winner in cyclic games. The main result is the proof of the fact that the nondeterministic potential transformation algorithm designed for solving parity games is exponential in terms of computation time.
Cited by 1
Xiang Yin · IEEE Transactions on Automatic Control · 2016
Recently, Ushio and Takai have proposed a Mealy-automata-based framework to study the non-blocking supervisory control problem under partial observation. This framework can handle observation uncertainties by taking both state-dependent observations and nondeterministic outputs into account. In this technical note, we propose a model-transformation-based approach to solve the supervisor synthesis problem in this framework. First, we propose a transformation algorithm that transforms the non-blocking supervisor synthesis problem for Mealy automata to a conventional supervisory synthesis problem under partial observation, which can be solved effectively by an existing algorithm. Then we show that the supervisor synthesized for the transformed problem indeed solves the original problem. Our results bridge the gap between the conventional supervisory control framework under partial observation and the recently proposed Mealy automata framework where nondeterministic output function is used.
Cited by 44
Hsu, Tzu-Han, Bonakdarpour, Borzoo, Finkbeiner, Bernd et al. · CISPA Helmholtz Center · 2023
Many types of attacks on confidentiality stem from the nondeterministic nature of the environment that computer programs operate in. We focus on verification of confidentiality in nondeterministic environments by reasoning about asynchronous hyperproperties. We generalize the temporal logic A-HLTL to allow nested trajectory quantification, where a trajectory determines how different execution traces may advance and stutter. We propose a bounded model checking algorithm for A-HLTL based on QBF-solving for a fragment of A-HLTL and evaluate it by various case studies on concurrent programs, scheduling attacks, compiler optimization, speculative execution, and cache timing attacks. We also rigorously analyze the complexity of model checking A-HLTL.
Cited by 0Open access
M. Damiani · 2002
Nondeterministic finite-state machines are being considered for extracting and representing sequential don't care conditions arising in high-level descriptions. This paper shows that they can also be used for capturing in full the sequential don't cares arising from embedding of a machine in a larger synchronous network in a uniform way. A novel algorithm for synthesizing a minimum-state deterministic finite-state machine from a nondeterministic one is developed here. The techniques developed in this paper are useful when incorporated in a synthesis system extracting sequential don't care information from high-level descriptions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 17
Cook, Joshua, Rothblum, Ron D. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2023
The celebrated IP = PSPACE Theorem gives an efficient interactive proof for any bounded-space algorithm. In this work we study interactive proofs for non-deterministic bounded space computations. While Savitch’s Theorem shows that nondeterministic bounded-space algorithms can be simulated by deterministic bounded-space algorithms, this simulation has a quadratic overhead. We give interactive protocols for nondeterministic algorithms directly to get faster verifiers. More specifically, for any non-deterministic space S algorithm, we construct an interactive proof in which the verifier runs in time Õ(n+S²). This improves on the best previous bound of Õ(n+S³) and matches the result for deterministic space bounded algorithms, up to polylog(S) factors. We further generalize to alternating bounded space algorithms. For any language L decided by a time T, space S algorithm that uses d alternations, we construct an interactive proof in which the verifier runs in time Õ(n + S log(T) + S d) and the prover runs in time 2^O(S). For d = O(log(T)), this matches the best known interactive proofs for deterministic algorithms, up to polylog(S) factors, and improves on the previous best verifier time for nondeterministic algorithms by a factor of log(T). We also improve the best prior verifier time for unbounded alternations by a factor of S. Using known connections of bounded alternation algorithms to bounded depth circuits, we also obtain faster verifiers for bounded depth circuits with unbounded fan-in.
Cited by 0Open access
N. Murugesan · 2014
Every regular expression can be transformed into a Nondeterministic Finite Automaton (NFA) with or without �-transitions. A well known algorithm called subset construction technique is used for conversion of NFA into DFA. In this paper, initially, the construction of the position automaton is given for the same. Also, the algorithm to convert this Position Automaton into DFA using subset construction technique is discussed. AMS MSC2010 Certification: 68Q45, 68Q70
Cited by 0
Ville Laurikari · Zenodo (CERN European Organization for Nuclear Research) · 2002
A conservative extension to traditional nondeterministic finite automata (NFAs) is proposed to keep track of the positions in the input string for the last uses of selected transitions, by adding "tags" to transitions. The resulting automata are reminiscent of nondeterministic Mealy machines. A formal semantics of automata with tagged transitions is given. An algorithm is given to convert these augmented automata to the corresponding deterministic automata, which can be used to process strings efficiently. The application to regular expressions is discussed, explaining how the algorithms can be used to implement, for example, substring addressing and a lookahead operator, and an informal comparison to other widely-used algorithms is made.
Cited by 59Open access
2008
A conservative extension to traditional nondeterministic finite automata is proposed to keep track of the positions in the input string for the last uses of selected transitions, by adding ”tags ” to transitions. The resulting automata are reminiscent of nondeterministic Mealy machines. Formal semantics of automata with tagged transitions is given. An algorithm is given to convert these augmented automata to corresponding deterministic automata, which can be used to process strings efficiently. Application to regular expressions is discussed, explaining how the algorithms can be used to implement for example substring addressing and a lookahead operator, and some informal comparison to other widely used algorithms is done. 1.
Cited by 0
Cai Shu-xun · 2012
The mechanism and complexity of the conversion algorithm from nondeterministic finite automata(NFA) to deterministic finite automata(DFA) were studied,and a great number of repeated traversal and invalid traversal phenomenon in the well known SUBSET algorithm were especially studied.An improved MF-SUBSET algorithm was proposed to solve the above problem.The simulation results indicated that the present searching strategy could be decided by the proposed MF-SUBSET algorithm through increasing status flags and traversal path flags,which could obviously avoid the repeated traversal and invalid traversal operation and effectively improve the conversion efficiency.
Cited by 0
Pedro García A, Manuelvázquez De Parga A, Gloria I. Álvarez B et al. · 2008
The aim of the paper is to develop a new algorithm that, with a complete sample as input, identifies the family of regular languages by means of nondeterministic finite automata. It is a states-merging algorithm and one of its main features is that the convergence (which is proved) is achieved independently from the order in which states are merged, that is, merging of states may be done ”randomly”.
Cited by 0
Shakila Banu, Naveena Selvaraj · SHILAP Revista de lepidopterología · 2023
A non-deterministic zero divisor graph refers to an element in a ring or algebraic structure that can multiply with another element to give zero, but the specific outcome of the multiplication is not uniquely determined. In other words, there may be multiple elements that can multiply with the given element to produce zero. This concept is typically encountered in non-commutative rings or algebras where the order of multiplication matters. In such structures, the existence of non-deterministic zero divisors can complicate calculations and lead to different results depending on the order of operations. In this paper, we examine that all the zerodivisor graphs are nondeterministic graph but the converse need not. We manifest the nondeterministic zero divisor graph is possible only with nonprimes. Hereby, we study about weighted graphs, Weiner index and golden ratio rule. Also we provide an algorithm for zero divisor graph of n parameters and thereby, explore the given graph is either deterministic or nondeterministic graph using python.
Cited by 0Open access