We develop a general constraint logic programming (CLP) based framework for specification and verification of real time systems. Our framework is based on the notion of timed automata that have traditionally been used...
详细信息
We develop a general constraint logic programming (CLP) based framework for specification and verification of real time systems. Our framework is based on the notion of timed automata that have traditionally been used for specifying real time systems. In our framework, a user models the ordering of real time events as the grammar of a language accepted by a timed automata, the real time constraints on these events are then captured as denotations of the grammar productions specified by the user. The grammar can be specified as a Definite Clause Grammar (DCG), while the denotations can be specified in constraint logic. The resulting specification can hence be regarded as a constraint logic program (CLP), and is executable. Many interesting properties of the real time system can be verified by posing appropriate queries to this CLP program. A major advantage of our approach is that it is constructive in nature, i.e., it can be used for computing the conditions under which a property will hold for a given real time system. Our framework also suggests new types of formalisms that we call constraint automata and timed push down automata.
作者：
Chris McDonaldKamran KazemiProgramming
Languages and Systems Group Department of Computer Science The University of Western Australia Crawley Western Australia 6907
The parallel programming community has long recognized the need for a simple programming environment offering interprocess communication between heterogeneous systems. As the Parallel Virtual Machine environment, PVM,...
ISBN:
(纸本)9780897918893
The parallel programming community has long recognized the need for a simple programming environment offering interprocess communication between heterogeneous systems. As the Parallel Virtual Machine environment, PVM, has emerged to meet this goal, an increasing number of educational institutions are choosing PVM to support their teaching of parallel and distributed computing using networks of workstations. However, it is often the nature of PVM's design and implementation that can severely limit its success in a teaching environment. This paper first motivates and then describes improvements to the PVM environment which increase both robustness and efficiency in an educational setting.
OMG's (Object Management Group) CORBA (Common Object Request Broker Architecture) is becoming a common platform for distributed computing environment. However, it is yet to address CSCW (computer Supported Collabo...
详细信息
This paper demonstrates how the demultiplexor is used for making a new tree embedded in a MIN and how the Augmented Generalized Cube Network is designed using this tree. Evaluation of its performance and examination o...
详细信息
ISBN:
(纸本)0818682272
This paper demonstrates how the demultiplexor is used for making a new tree embedded in a MIN and how the Augmented Generalized Cube Network is designed using this tree. Evaluation of its performance and examination of its characteristics are also included. The demultiplexor was originally used for providing tolerance for destination link failures. The above shows that the AGCN gets better performance than other MINs. Not only does the AGCN have all of the Generalized Cube Network's features but it also offers multiple paths using a new embedded tree and intrastage links. Its self-adaptive routing in the last stage can alleviate tree saturation and contribute greatly to performance improvement.
OMG's (Object Management Group) CORBA (Common Object Request Broker Architecture) is becoming a common platform for distributed computing environment. However, it is yet to address CSCW (computer Supported Collabo...
详细信息
OMG's (Object Management Group) CORBA (Common Object Request Broker Architecture) is becoming a common platform for distributed computing environment. However, it is yet to address CSCW (computer Supported Collaborative Work) ftamework. This paper addresses the problem of building a framework for CSCW and proposes a new CSCW framework based on CORBA (CFC). CFC includes session, participant, mode, directory, stream, media and resource management. A desktop conference system and DSM-CC compliant video-on-demand system were built to demonstrate the usefulness of the framework. The performance of CORBA based CSCW applications is given. The strengths and weaknesses of using a CORBA framework are also discussed.
Object-oriented (OO) software development techniques have gained in popularity as an attractive alternative to the traditional, structured development approach. Fundamental to the OO approach is the object, which bund...
详细信息
Object-oriented (OO) software development techniques have gained in popularity as an attractive alternative to the traditional, structured development approach. Fundamental to the OO approach is the object, which bundles data with associated operations in a self-contained unit. The inherently modular object provides an excellent mechanism for creating reusable, stable, and easily maintainable code. In this paper, we present an introduction to OO development; discuss the challenges of large, complex systems; and document the procedures we developed to meet these challenges for our project.
Fail-safety is a system attribute which ensures that a program either completes its execution satisfying its post-conditions in the normal manner or signals its failure to do so to its operating environment. Such an a...
详细信息
Fail-safety is a system attribute which ensures that a program either completes its execution satisfying its post-conditions in the normal manner or signals its failure to do so to its operating environment. Such an attribute is desirable of any system as it ensures the correctness of results which are produced. A very few modern sequential programming languages offer program fail-safety through the judicious use of a well designed exception handling mechanism. In this paper the exception handling techniques used in those sequential systems are developed to provide the guidelines for fail-safe concurrent system design. (C) 1997 Elsevier Science Ltd.
Given a polynomial with symbolic/literal coefficients,a complete discrimination system is a set of explicit expressions in terms of the coefficients,which is sufficient for determining the numbers and multiplicities o...
详细信息
Given a polynomial with symbolic/literal coefficients,a complete discrimination system is a set of explicit expressions in terms of the coefficients,which is sufficient for determining the numbers and multiplicities of the real and imaginary *** it is of great significance,such a criterion for root-classification has never been given for polynomials with degrees greater than *** lack of efficient tools in this aspect extremely prevents computer implementations for Tarski’s and other methods in automated theorem *** remedy this defect,a generic algorithm is proposed to produce a complete discrimination system for a polynomial with any *** result has extensive applications in various fields,and its efficiency was demonstrated by computer implementations.
Provides the rationale for establishing a connection to the Internet. Describes Internet services, including e-mail, telnet, file transfer protocol (FTP), USENET, gopher, Archie, and World Wide Web. Identifies reasons...
详细信息
Provides the rationale for establishing a connection to the Internet. Describes Internet services, including e-mail, telnet, file transfer protocol (FTP), USENET, gopher, Archie, and World Wide Web. Identifies reasons why the Internet is a valuable tool. Outlines steps for establishing a connection and discusses the future of the Internet. A sidebar includes listserv addresses. (Author/AEF)
We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for in...
详细信息
We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.
暂无评论