Results 191 to 200 of about 21,948 (228)
Some of the next articles are maybe not open access.
Interpretation of Probabilistic Algorithmic Logic in Nondeterministic Algorithmic Logic
6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07), 2007In this paper probabilistic and nondeterministic programs are considered on the ground of logic of programs. The formal semantics of probabilistic and nondeterministic computations of a program are the starting point for the comparing properties of these programs.
openaire +1 more source
Linear Nondeterministic Dawg String Matching Algorithm (Abstract)
2004The exact string matching problem is to find all the occurrences of a given pattern x=x 1 x 2 ··· x m in a large text y=y 1 y 2 ··· y n , where both x and y are sequences of symbols drawn from a finite character set Σ of size σ.
Longtao He, Binxing Fang
openaire +1 more source
Algorithmic Formal Proof of Equivalence of Nondeterministic and Deterministic Finite Automata
2009 International Conference on Electronic Computer Technology, 2009The design of a complex system requires both functional and behavior representation. Formal methods are mathematical based techniques used for specifications of properties hardware and software systems. The Znotation is a formal technique used for capturing functionality. Automata theory is a powerful tool to capture their control behavior. As a result,
Nazir Ahmad Zafar +1 more
openaire +1 more source
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case
Programming and Computer Software, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burdonov, I. B. +2 more
openaire +2 more sources
2006 Seventh International Conference on Web-Age Information Management Workshops, 2006
Nondeterministic behaviors of parallel programs require dedication software testing functionality. It is very difficult to test nondeterministic parallel programs systematically. Although plain reachability testing method can deal with the non-determinism, it may generate huge number of execution paths during the testing procedure.
Wei Wang, Wu Yang, Lejun Zhang, Lin Guo
openaire +1 more source
Nondeterministic behaviors of parallel programs require dedication software testing functionality. It is very difficult to test nondeterministic parallel programs systematically. Although plain reachability testing method can deal with the non-determinism, it may generate huge number of execution paths during the testing procedure.
Wei Wang, Wu Yang, Lejun Zhang, Lin Guo
openaire +1 more source
2020
The paper considers the decomposition of process control algorithms for parallel computing systems using automata models. When designing parallel processing systems, an important problem is the formal representation of process control algorithms since they allow integrated solving the tasks of specification, development, implementation, verification ...
Dmitry Pashchenko +2 more
openaire +1 more source
The paper considers the decomposition of process control algorithms for parallel computing systems using automata models. When designing parallel processing systems, an important problem is the formal representation of process control algorithms since they allow integrated solving the tasks of specification, development, implementation, verification ...
Dmitry Pashchenko +2 more
openaire +1 more source
2009 17th Mediterranean Conference on Control and Automation, 2009
Recently supervisor synthesis for nondeterministic systems has gained more and more attention, owing to the potential computational advantage of using nondeterministic automata in modular/distributed synthesis. It is well known that, in the Ramadge/Wonham language-based supervisory control paradigm, the supremal nonblocking normal supervisor always ...
Su, R., Schuppen, van, J.H., Rooda, J.E.
openaire +1 more source
Recently supervisor synthesis for nondeterministic systems has gained more and more attention, owing to the potential computational advantage of using nondeterministic automata in modular/distributed synthesis. It is well known that, in the Ramadge/Wonham language-based supervisory control paradigm, the supremal nonblocking normal supervisor always ...
Su, R., Schuppen, van, J.H., Rooda, J.E.
openaire +1 more source
A new algorithm of the state-minimization for the nondeterministic finite automata
Korean Journal of Computational & Applied Mathematics, 1999Summary: The problem of the state-minimization for the nondeterministic finite Rabin-Scott's automata is considered. A new algorithm for this problem is obtained. The obtained algorithm has the exponential effectiveness, like the earlier known algorithms for this problem.
openaire +2 more sources
2010
We discuss two, in a sense extreme, kinds of nondeterministic rules in decision tables. The first kind of rules, called as inhibitory rules, are blocking only one decision value (i.e., they have all but one decisions from all possible decisions on their right hand sides).
Paweł Delimata +5 more
openaire +1 more source
We discuss two, in a sense extreme, kinds of nondeterministic rules in decision tables. The first kind of rules, called as inhibitory rules, are blocking only one decision value (i.e., they have all but one decisions from all possible decisions on their right hand sides).
Paweł Delimata +5 more
openaire +1 more source
Calcolo, 1971
This paper presents an algorithmic interpretation of a method for the formal definition of programming lauguages which holds for languages having an ALGOL-like or PL/1-like structure. This algorithm is a Generalized Markov Algorithm (GMA) and models the behaviour of the abstract machine defined by the IBM Vienna Laboratory group for the formal ...
openaire +1 more source
This paper presents an algorithmic interpretation of a method for the formal definition of programming lauguages which holds for languages having an ALGOL-like or PL/1-like structure. This algorithm is a Generalized Markov Algorithm (GMA) and models the behaviour of the abstract machine defined by the IBM Vienna Laboratory group for the formal ...
openaire +1 more source