Automated abstraction is widely recognized as a key method for computer-aided verification of hardware and software. In this paper, we describe the evolution of counterexample-guided refinement and other iterative abs...
详细信息
Business process modeling plays a major role in industry and academia. As a result, current research focuses on its assistance. Business process modeling is a time-consuming task and its effort is hard to predict, and...
详细信息
ISBN:
(纸本)9783885792710
Business process modeling plays a major role in industry and academia. As a result, current research focuses on its assistance. Business process modeling is a time-consuming task and its effort is hard to predict, and a plethora of concepts exists for facilitating and improving it. A concept that has not been studied yet is prediction of the remaining effort of business process modeling. In this paper we tackle this issue and suggest a solution for measuring the progress of business process modeling. Our solution is based on the assumption that a reference model is given representing a best practice of a business process. In addition, a set of process variants exists for that reference model. Under these conditions, we propose two measurement approaches that base on the longest common subsequence algorithm and determine the effort required to complete business process modeling. The main benefit of the approaches is the possibility of effectively structuring and monitoring the development of business process modeling projects.
We present a new method for fighting the state space explosion of process algebraic specifications, by performing static analysis on an intermediate format: linear process equations (LPEs). Our method consists of two ...
详细信息
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bordered if there exists a proper prefix...
详细信息
The separation of source coding into two stages, modeling and encoding, is a highly successful approach. We propose meta-modeling as an additional stage. As an application, we use this paradigm to deduce an efficient ...
详细信息
The separation of source coding into two stages, modeling and encoding, is a highly successful approach. We propose meta-modeling as an additional stage. As an application, we use this paradigm to deduce an efficient and optimal algorithm for a novel and powerful model set: the classification tree sources. Our results on classification tree sources unify and generalize prior results for tree sources. Moreover, we point out applications in text and image compression.
Testing is inherently incomplete;no test suite will ever be able to test all possible usage scenarios of a system. It is therefore vital to assess the implication of a system passing a test suite. This paper quantifie...
详细信息
Testing is inherently incomplete;no test suite will ever be able to test all possible usage scenarios of a system. It is therefore vital to assess the implication of a system passing a test suite. This paper quantifies that implication by means of two distinct, but related, measures: the risk quantifies the confidence in a system after it passes a test suite, i.e., the number of faults still expected to be present (weighted by their severity);the actual coverage quantifies the extent to which faults have been shown absent, i.e., the fraction of possible faults that has been covered. We provide evaluation algorithms that calculate these metrics for a given test suite, as well as optimisation algorithms that yield the best test suite for a given optimisation criterion.
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if ...
详细信息
ISBN:
(纸本)3540857796
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if it possesses no proper prefix that is also a suffix of that word. Suppose ki , with two different letters a and b and i1, and b i occurs exactly once in w. This answers a conjecture by Harju and the second author of this paper about a structural property of maximum Duval extensions. Moreover, we show here that i
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state enco...
详细信息
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for free-choice, bounded, and general STGs.
暂无评论