We write the relations that characterize the simpliest timed automaton, the inertial delay buffer, in two versions: the non-deterministic and the deterministic one, by making use of the derivatives of the } 1 , 0 { → R functions.

One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means that the content models are deterministic regular expressions. This determinism is defined semantically without known syntactic definition for it, thus making it difficult for users to design. Presently however, no wo...

Subset construction is the method of converting a nondeterministic nite-state machine into a deterministic one. The process of determinization is an important one in any implementation of nite-state machines since nondeterministic machines are often easier to describe than their deterministic equivalents and the conversion of regular expressions to nite-state machines usually produces nondeterm...

NRC’s approach to ensuring the safety of nuclear power includes two complementary approaches, one more deterministic and one more probabilistic. These two approaches address the uncertainties in the underlying methods and data differently, with each approach having its strengths and limitations. This paper provides some background on the historical evolution of deterministic and probabilistic m...

A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithmetic based on quantifier elimination is known (roughly, there is a double-exponential non-deterministic time lower bound and a triple exponential deterministic time upper bound), the exact complexity of the automata-based procedu...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

In this paper, a stochastic two-stage model is offered for optimization of the day-ahead scheduling of the microgrid. System uncertainties including dispatchable distributed generation and energy storage contingencies are considered in the stochastic model. For handling uncertainties, Monte Carlo simulation is employed for generation several scenarios and then a reduction method is used to decr...

In this study, we considered an inflationary inventory control model under non-deterministic conditions. We assumed the inflation rate as a normal distribution, with any arbitrary probability density function (pdf). The objective function was to minimize the total discount cost of the inventory system. We used two methods to solve this problem. One was the classic numerical approach which turne...