The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A system is always may-terminating, if and only if from every reachable state, a terminal state is reachable. This publication argues that it is beneficial for both catching non-progress errors and stubborn, ample, and persistent set state space reduction to try to make verification models always may-terminating. An incorrect mutual exclusion algorithm is used as an example. The error does not manifest...
The Business Process Modeling Notation (BPMN) is an emerging standard for capturing business processes. However, BPMN lacks a formal semantics and many of its features are subject to interpretation, which is hindered the BPMN as a standard to statically check the semantic correctness of models. The fact that BPMN integrates constructs from graph-oriented process definition languages with features...
This paper addresses the segmentation problem in noisy image based on Fast Edge Integration (FEI) method in active contour model (ACM) and proposes a new statistical active contour model (SACM). Two modifications are performed in FEI method. First, in order to handle noisy images, maximum log-likelihood estimation is used to replace the minimal variance term proposed by Chan and Vese. Second, a penalising...
The UNICORE grid system provides a seamless, secure and intuitive access to distributed grid resources. In recent years, UNICORE 5 is used as a well-tested grid middleware system in production grids (e.g. DEISA, D-Grid) and at many supercomputer centers world-wide. Beyond this production usage, UNICORE serves as a solid basis in many European and International research projects and business scenarios...
We consider the relative power of concurrentwrite PRAMs when the number of processors (and input variables) is fixed at n, and infinite shared memory is allowed. Several different models (COMMON, ARBITRARY, PRIORITY) have been used for algorithm design in the literature; these models differ in their method of write-conflict resolution. Recent work in separating these models ([FRW1,2,3], [LY]) has...
We show that the permutation group membership problem can be solved in depth (logn)3 on a Monte Carlo Boolean circuit of polynomial size in the restricted case in which the group is abelian. We also show that this restricted problem is NC1-hard for NSPACE(logn).
A complexity theory for unbounded fan-in parallelism is developed where the complexity measure is the simultaneous measure (number of processors, parallel time). Two models of unbounded fan-in parallelism are (1) parallel random access machines that allow simultaneous reading from or writing to the same common memory location, and (2) circuits containing AND's, OR's and NOT's with no bound placed...
This paper gives a personal account of some developments in automata theory and computational complexity theory. Though the account is subjective and deals primarily with the research areas of direct interest to the author, it discusses the underlying beliefs and philosophy which guided this research as well as the intellectual environment and the ideas and contacts which influenced it. An attempt...
A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl. A representation theorem, analogous to the Chomsky-Schützenberger representation theorem for context free languages1, is proved for the class nl. One consequence is that nl is a principal full AFL generated...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.