Hamid Karimi, Amir Abbas Najafi · SHILAP Revista de lepidopterología · 2013
In this paper, we consider a reliability redundancy optimization problem in a series-parallel type system employing the redundancy strategy of cold-standby. The problem consists of two parts component selection and determination of redundancy level of each component—which need to be solved so that the mean lifetime of the system can be maximized. The redundancy allocation problem is nondeterministic polynomial-time hard and is solved by a combined genetic algorithm - simulation approach. Finally, this algorithm is tested on 33 benchmark problems.
Cited by 0Open access
Pedro García, José Ruiz, Antonio Cano · 2008
A Residual Finite State Automaton (RF SA) [2],[3],[4] is a Nondeterministic Finite Automaton (NFA) in which every state corresponds to a residual language of the language it recognizes. We describe in this paper an algorithm that, for a given sample D, infersaRF SA consistent with D that converges to the canonical RF SA of the target language using a generalization of RP NI algorithm. As NFA’s are sometimes smaller than their equivalent deterministic minimal automaton, the characteristic sample required for inference may also be smaller, so this algorithm may be useful. We also describe how to use this algorithm to infer the universal automaton for a language. 1
Cited by 0
N.J. Drost · 1994
This paper contains a unification algorithm for a restricted process algebra with as only operators nondeterministic choice and unary action prefix-operators, and with infinite processes. Termination is ensured by using a modified version of a method for syntactic unification described in [Col84a] and [Col84b]. The algorithm contains a procedure to remove non-most general solutions. Key words and phrases: unification, process algebra. Contents 1 Introduction 2 2 Algebra and theory 5 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2 The theory : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.3 The model P : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3 The algorithm UnPref 10 3.1 Introduction and definitions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 10 3.2 The rules : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 3.3 The algo...
Cited by 0
Shota Matsumoto, Fumihiko Kono, Teruya Kobayashi et al. · Electronic Notes in Theoretical Computer Science · 2015
A modeling language for hybrid systems HydLa and its implementation HyLaGI are described. HydLa is a constraint-based language that can handle uncertainties of models smoothly. HyLaGI calculates trajectories by symbolic formula manipulation to exclude errors resulting from floating-point arithmetic. HyLaGI features a nondeterministic simulation algorithm so it can calculate all possible qualitative different trajectories of models with uncertainties.
Cited by 3Open access
Chen Chang, Wang Dongxiao, Xiao Liangang · 2016
Abstract—Time synchronization provides uniform timescale for distributed sensor networks. In this paper a genetic based time synchronization optimize algorithm is proposed. It first generated the nondeterministic transmitting delay and then adopted the genetic algorithm to simulating these delays. Minimal linear fit residual error is selected as fitness function to evaluate the simulating effect. After finding the best fitness delay sequence, the time skew and offset is estimated by linear regression. The experiment result shows that the synchronization precision could be improved from 11.8 s to 3.5 s Keywords-Sensor networks; Time synchronization;Genetic algorithm;Optimize;Precision I.
Cited by 0
Joachim Peer · 1999
This paper illustrates how a modified version of a modern Partial Order Planner (POP) can be combined with a replanning algorithm to solve planning problems in Web service domains. The contributions of the work are (i) a method of using feedback gained from plan execution for improving plan search and (ii) a novel approach of dealing with nondeterministic Web service operations.
Cited by 0
Mikael Lindberg · Lund University Publications (Lund University) · 2010
An approach to constrained resource allocation for real time software components executing on nondeterministic hardware is considered. A model for resource consumption based on execution rate is investigated together with an event-based measurement and parameter estimation scheme. Finally, an algorithm for real time constrained optimization of resources is presented together with results from a case study with synthetic software components.
Cited by 1Open access
Mirko Fiacchini, Marc Jungers, Antoine Girard · HAL (Le Centre pour la Communication Scientifique Directe) · 2016
In this paper, the stabilizability of discrete-time linear switched systems subject to constraints on the switching law is considered. The admissible switching sequences are given by the language generated by a nondeterministic finite state automaton. An algorithm is proposed for computing contractive sets defined in the space of the continuous and finite states that induce recurrent exponential control Lyapunov functions for the system. A necessary and sufficient condition for the existence of recurrent control Lyapunov functions is given in terms of finite termination of the algorithm.
Cited by 3Open access
Carsten Kern, Technischen Hochschule, Aachen Erlangung et al. · 2009
The results of this dissertation are two-fold. On the one hand, inductive learning techniques are extended and two new inference algorithms for inferring nondeterministic, and universal, respectively, finite-state automata are presented. On the other hand, certain learning techniques are employed and enhanced to semi-automatically infer communicating automata (also called design models in the software development cycle). For both topics, theoretical results on the feasibility of the approaches, as well as an implementation are presented which, in both cases, support our theory. Concerning the first objective to derive a so-called active online learning algorithm for nondeterministic finite-state automata (NFA), we present, in analogy to Angluin’s famous learning algorithm L ∗ [Ang87a] for deterministic finite-state automata (DFA), a version for inferring a certain subclass of NFA. The automata from this class are called residual finitestate automata (RFSA). It was shown by Denis et al. [DLT02] that there is an exponential gap between the size of minimal DFA and their corresponding minimal RFSA. Even if there are also cases where the canonical (i.e., minimal) RFSA is exponentially larger than
Cited by 0
Christel Baier, et al. · 1997
We consider concurrent probabilistic systems which distinguish between nondeterministic and probabilistic choice. Such systems typically arise as formal models of randomized distributed systems as considered by Segala & Lynch [29, 34, 36]. By resolving only the nondeterministic choices,these models can be decomposed into a collection of "computation trees". The presence of nondeterminism means thatcertain liveness properties cannot be established unless fairness is assumed. We introduce a probabilistic branching timelogic P BT L whose formulas express properties such as "ev-ery request is eventually granted with probability at least p " and give an interpretation for P BT L on concurrent pro-babilistic systems, where the branching time quantifiers are taken to range over a certain kind of fair computation trees.We then present a model checking algorithm for verifying whether a concurrent probabilistic system satisfies a P BT Lformula assuming fairness constraints, and also discuss how to modify the algorithm of Bianco & de Alfaro, which can beapplied to P BT L \\Lambda, to cater for fairness.
Cited by 0
Morteza Lahijanian, Lydia E. Kavraki, Moshe Y. Vardi · 2014
This paper introduces a strategy planner for nondeterministic hybrid systems with complex continuous dynamics. The planner uses sampling-based techniques and game-theoretic approaches to generate a series of plans and decision choices that increase the chances of success within a fixed time budget. The planning algorithm consists of two phases: exploration and strategy improvement. During the exploration phase, a search tree is grown in the hybrid state space by sampling state and control spaces for a fixed amount of time. An initial strategy is then computed over the search tree using a game-theoretic approach. To mitigate the effects of nondeterminism in the initial strategy, the strategy improvement phase extends new tree branches to the goal, using the data that is collected in the first phase. The efficacy of this planner is demonstrated on simulation of two hybrid and nondeterministic car-like robots in various environments. The results show significant increases in the likelihood of success for the strategies computed by the two-phase algorithm over a simple exploration planner.
Cited by 12
David Zelenka · Zenodo (CERN European Organization for Nuclear Research) · 2025
We examine the tradeoff between time and parallelism in exact algorithms for NP-complete problems. While it is folklore that exponential parallelism can simulate nondeterministic search in polynomial time, this observation is often interpreted as permitting a perfect conservation of exponential cost. We show that such an exact tradeoff is impossible. For any exact algorithm deciding an NP-complete language, the product of time and parallelism must exceed the size of the nondeterministic search space by a constant factor. This irreducible loss arises not from physical constraints but from structural properties of computation: non-injectivity of verification, information erasure, and limits on compressibility. We formalize this loss via Kolmogorov complexity and prefix-free coding and prove the Irreducible Overhead theorem: exponential computational cost cannot be conserved exactly across time and parallelism.
Cited by 0Open access
Lingling Wang, Hua Li, Xinming Ye et al. · 2009
Interoperability testing involve at least two IUTs, sometimes one of two IUTs is called QE(qualified equipment) which plays a measurement role during the testing process. It can be used to verdict the other one IUT's interoperability capability. This paper presents a modeling method to describe QE as a PNFSM (probability nondeterministic finite state machine) and based on it to select test sequence. According to the nondeterministic finite state machine of specification and the current experience of interoperability testing, a PNFSM is gradually constructed. The achieved model efficiently describes the current situation of interoperability testing. Based on PNFSM and the certain policy, the algorithm which is used to select test sequence is presented. The algorithms' validity is proved by an example. Finally the conclusion and the research work in the future are introduced.
Cited by 0
David Zelenka · Zenodo (CERN European Organization for Nuclear Research) · 2025
We examine the tradeoff between time and parallelism in exact algorithms for NP-complete problems. While it is folklore that exponential parallelism can simulate nondeterministic search in polynomial time, this observation is often interpreted as permitting a perfect conservation of exponential cost. We show that such an exact tradeoff is impossible. For any exact algorithm deciding an NP-complete language, the product of time and parallelism must exceed the size of the nondeterministic search space by a constant factor. This irreducible loss arises not from physical constraints but from structural properties of computation: non-injectivity of verification, information erasure, and limits on compressibility. We formalize this loss via Kolmogorov complexity and prefix-free coding and prove the Irreducible Overhead theorem: exponential computational cost cannot be conserved exactly across time and parallelism.
Cited by 0Open access
Allan Borodin, Stephen Cook, Patrick Dymond et al. · 1988
A recent proof that nondeterministic space-bounded complexity classes are closed under complementation is used to develop two further applications of the inductive counting technique. An errorless probabilistic algorithm is given for the undirected graph s-t connectivity problem that runs in O(log n) space and polynomial expected time, and it is shown that the class LOGCFL is closed under complementation. The latter is a special case of a general result that shows closure under complementation of classes defined by semiunbounded fan-in circuits (or, equivalently, nondeterministic auxiliary pushdown automata or tree-sized bounded alternating Turing machines). As one consequence, small numbers of role switches in two-person pebbling can be eliminated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 23
David Zelenka · Open MIND · 2025
We examine the tradeoff between time and parallelism in exact algorithms for NP-complete problems. While it is folklore that exponential parallelism can simulate nondeterministic search in polynomial time, this observation is often interpreted as permitting a perfect conservation of exponential cost. We show that such an exact tradeoff is impossible. For any exact algorithm deciding an NP-complete language, the product of time and parallelism must exceed the size of the nondeterministic search space by a constant factor. This irreducible loss arises not from physical constraints but from structural properties of computation: non-injectivity of verification, information erasure, and limits on compressibility. We formalize this loss via Kolmogorov complexity and prefix-free coding and prove the Irreducible Overhead theorem: exponential computational cost cannot be conserved exactly across time and parallelism.
Cited by 0Open access
Hartmanns, Arnd · Publications of the UdS (Saarland University) · 2015
The formal methods approach to develop reliable and efficient safety- or performance-critical systems is to construct mathematically precise models of such systems on which properties of interest, such as safety guarantees or performance requirements, can be verified automatically. In this thesis, we present techniques that extend the reach of exhaustive and statistical model checking to verify reachability and reward-based properties of compositional behavioural models that support quantitative aspects such as real time and randomised decisions. \nWe present two techniques that allow sound statistical model checking for the nondeterministic-randomised model of Markov decision processes. We investigate the relationship between two different definitions of the model of probabilistic timed automata, as well as potential ways to apply statistical model checking. Stochastic timed automata allow nondeterministic choices as well as nondeterministic and stochastic delays, and we present the first exhaustive model checking algorithm that allows their analysis. All the approaches introduced in this thesis are implemented as part of the Modest Toolset, which supports the construction and verification of models specified in the formal modelling language Modest. We conclude by applying this language and toolset to study novel distributed control strategies for photovoltaic microgenerators.
Cited by 0Open access
Bogusław Schreyer, Krzysztof Kosiński · Theoretical and Applied Informatics · 2010
There are analogies between modeling the transportation systems with critical resources (CR) and a critical section (CS) problem in operating systems. This article is developing this analogy in the direction of using the finite automata. The article analyses Peterson’s algorithm [4], [5] and Lamport’s algorithm [2] using deterministic finite automata (DFA) as well as it takes into consideration the problem of modeling traffic with binary semaphore using nondeterministic finite automata (NFA). Introduction of finite automata makes traffic control modeling much clearer on programming side and brings hardware application closer to such control.
Cited by 1
Min Hong Yun, Sun Ja Kim, Heung Nam Kim · 2004
`Time′ and `user event′ facts in nondeterministic multimedia presentation make a scheduler hard to determine when multimedia objects are to be rendered. The paper proposes a scheduling algorithm, called Event-based Scheduling (EBS) algorithm which is composed of two steps, preprocessing step and rendering step. In the preprocessing step, all user interaction (event) facts and ail temporal facts of begin condition are converted into `event + time′ fact. After the preprocessing step that sets start condition with `event + time’ fact, event-based table (waiting list) is generated and used to render multimedia objects in rendering step.
Cited by 0
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron · 2009
We describe a solution to the SAT problem via non-conuent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-conuently and in polynomial time by this kind of P systems is exactly the class NP.
Cited by 0