This paper introduces transversal graphs for plans(acyclic directed graphs with labeled vertices) and shows how to reduce various super- and subsequence problems on plans to searching paths in the transversal *** the ...
详细信息
This paper introduces transversal graphs for plans(acyclic directed graphs with labeled vertices) and shows how to reduce various super- and subsequence problems on plans to searching paths in the transversal *** the concept of transversal graphs for sets of strings and the concept of maximal independent set graphs for plans, the transversal graphs for plans allow to solve a wider class of problems in plan merging,project planning,precedence constrained scheduling, manufacturing systems design and DNA sequencing.
It is a general problem to investigate the trade off between the complexity of algorithmic problems, the structure of the input objects and the expressive power of problem description languages. The article concentrat...
详细信息
作者：
Seese, Detlef
AIFB Institute for Applied Computer Science and Formal Description Methods D - 76128 Karlsruhe Germany
It is a general problem to investigate the trade off between the complexity of algorithmic problems, the structure of the input objects and the expressive power of problem description languages. The article concentrat...
详细信息
Inherent imperfections in the VLSI fabrication processes mean that even logically correct designs may be fabricated as faulty chips. Testing of devices is therefore essential. The author considers the use of CCS to de...
详细信息
Inherent imperfections in the VLSI fabrication processes mean that even logically correct designs may be fabricated as faulty chips. Testing of devices is therefore essential. The author considers the use of CCS to deduce testability features of VLSI. He shows first that a natural correspondence exists between circuit designs and a certain class of processes in CCS (a popular abstract language for reasoning about concurrent systems), and then use this correspondence to show how standard faults can economically be represented, and reasoned about. Questions considered include: given such and such a fault, when can it be detected? If a fault is detectable, to what extent can its location be identified? And given a design, can one construct a logically equivalent process of improved testability?.< >
Markov Chains are widely used as stochastic models to study a broad spectrum of system performance and dependability characteristics. This monograph is devoted to compositional specification and analysis of Markov cha...
详细信息
ISBN:
(数字)9783540458043
ISBN:
(纸本)9783540442615
Markov Chains are widely used as stochastic models to study a broad spectrum of system performance and dependability characteristics. This monograph is devoted to compositional specification and analysis of Markov chains.;Based on principles known from process algebra, the author systematically develops an algebra of interactive Markov chains. By presenting a number of distinguishing results, of both theoretical and practical nature, the author substantiates the claim that interactive Markov chains are more than just another formalism: Among other, an algebraic theory of interactive Markov chains is developed, devise algorithms to mechanize compositional aggregation are presented, and state spaces of several million states resulting from the study of an ordinary telefone system are analyzed.
Past, Present, and Future of Knowledge Acquisition This book contains the proceedings of the 11th European Workshop on Kno- edge Acquisition, Modeling, and Management (EKAW ’99), held at Dagstuhl Castle (Germany) in ...
详细信息
ISBN:
(数字)9783540487753
ISBN:
(纸本)9783540660446
Past, Present, and Future of Knowledge Acquisition This book contains the proceedings of the 11th European Workshop on Kno- edge Acquisition, Modeling, and Management (EKAW ’99), held at Dagstuhl Castle (Germany) in May of 1999. This continuity and the high number of s- missions re?ect the mature status of the knowledge acquisition community. Knowledge Acquisition started as an attempt to solve the main bottleneck in developing expert systems (now called knowledge-based systems): Acquiring knowledgefromahumanexpert. Variousmethodsandtoolshavebeendeveloped to improve this process. These approaches signi?cantly reduced the cost of - veloping knowledge-based systems. However, these systems often only partially ful?lled the taskthey weredevelopedfor andmaintenanceremainedanunsolved problem. This required a paradigm shift that views the development process of knowledge-based systems as a modeling activity. Instead of simply transf- ring human knowledge into machine-readable code, building a knowledge-based system is now viewed as a modeling activity. A so-called knowledge model is constructed in interaction with users and experts. This model need not nec- sarily re?ect the already available human expertise. Instead it should provide a knowledgelevelcharacterizationof the knowledgethat is requiredby the system to solve the application task. Economy and quality in system development and maintainability are achieved by reusable problem-solving methods and onto- gies. The former describe the reasoning process of the knowledge-based system (i. e. , the algorithms it uses) and the latter describe the knowledge structures it uses (i. e. , the data structures). Both abstract from speci?c application and domain speci?c circumstances to enable knowledge reuse.
This volume contains the proceedings of the second joint PAPM-PROBMIV Workshop, held at the University of Copenhagen, Denmark, July 25–26, 2002 as part of the Federated Logic Conference (FLoC 2002). The PAPM-PROBMIV ...
详细信息
ISBN:
(数字)9783540456056
ISBN:
(纸本)9783540439134
This volume contains the proceedings of the second joint PAPM-PROBMIV Workshop, held at the University of Copenhagen, Denmark, July 25–26, 2002 as part of the Federated Logic Conference (FLoC 2002). The PAPM-PROBMIV workshop results from the combination of two wo- shops: PAPM (Process Algebras and Performance Modeling) and PROBMIV (Probabilistic methods in Veri?cation). The aim of the joint workshop is to bring together the researchers working across the whole spectrum of techniques for the modeling, speci?cation, analysis, and veri?cation of probabilistic systems. Probability is widely used in the design and analysis of software and hardware systems, as a means to derive e?cient algorithms (e.g. randomization), as a model for unreliable or unpredictable behavior (as in the study of fault-tolerant systems and computer networks), and as a tool to study performance and - pendability properties. The topics of the workshop include speci?cation, m- els, and semantics of probabilistic systems, analysis and veri?cation techniques, probabilistic methods for the veri?cation of non-probabilistic systems, and tools and case studies. The ?rst PAPM workshop was held in Edinburgh in 1993; the following ones were held in Regensberg (1994), Edinburgh (1995), Turin (1996), Enschede (1997), Nice (1998), Zaragoza (1999), and Geneva (2000). The ?rst PROBMIV workshop was held in Indianapolis, Indiana (1998); the next one took place in Eindhoven (1999). In 2000, PROBMIV was replaced by a Dagstuhl seminar on Probabilistic methods in Veri?cation.
暂无评论