{"title":"Extended the DARTS software design method to distributed real time applications","authors":"H. Gomaa","doi":"10.1109/HICSS.1988.11813","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11813","url":null,"abstract":"A software design method is described for distributed real-time applications that typically consist of several concurrent tasks executing on multiple nodes supported by a local area network. The design method is an extension of DARTS (design approach for real-time systems) and is called DARTS/DA (DARTS for distributed applications). The method starts by developing a data-flow model of the distributed application using structured analysis. The next stage involves decomposing the application into distributed subsystems based on a set of subsystem structuring criteria and defining the interfaces between therm. next each subsystem is structured into concurrent tasks using the DARTS task-structuring criteria, and the interfaces between tasks are defined. Finally each task is structured into modules. As an example, DARTS/DA is applied to the design of a distributed factory-automation system.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131354008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mathematical aspects of box structures","authors":"H. Mills, R. Linger, A. Hevner","doi":"10.1109/HICSS.1988.11875","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11875","url":null,"abstract":"The box structures of black box, state machine, and clear box, which are fundamental objects for analysis and design of information systems in the box structure methodology, are considered. Mathematical properties of each of the box structures are presented. Derivation and expansion tasks provide a means of converting a system from one box structure representation to another. An actual case study involving the US Navy power system demonstrates the use of derivation and expansion in the analysis of a supply reorder policy.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The PEG environment: parallel programming with Petri net semantics","authors":"P. D. Stotts","doi":"10.1109/HICSS.1988.11861","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11861","url":null,"abstract":"The author discusses PFG (parallel flow graphs), a hardware/software system modeling language and support environment based on a concurrent, place-timed deterministic Petri net formalism termed the HG (hierarchical graph) model of time-dependent concurrent systems. The HG model serves as the formal semantics of computation for the PFG language, which has a graphical syntax and serves as a composition vehicle for Petri nets that have interpretable form and limited complexity. The PFG environment is a collection of cooperating tools that operate on these HG models for the production of reliable time-dependent software systems from reusable components. Algorithms that have been developed for analysis of the HG formalism include detection and correction of improper access to shared data, calculation of minimum and maximum execution time bounds, and matching of models to graphical specification templates for reuse.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114094362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SEGUE: support for distributed graphical interfaces","authors":"S. Schaffner, M. Borkan","doi":"10.1109/HICSS.1988.11860","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11860","url":null,"abstract":"A description is given of SEGUE, a system for the specification and generation of structured graphical interfaces for distributed systems. The user interface resides on as raster-graphics workstation, but the application program may execute on one or more other machines connected to that workstation by a local area network. SEGUE is based on standard editor technology, but extends it to provide a general interface to arbitrary application programs and to allow the interface to be remote from the application program. It is based on the specification of two tree structures and a mapping between them. One tree corresponds to data structures in the application program, while the other defines the user display. A prototype version of SEGUE has been built on a SUN workstation and has been used to build a number of interfaces, including one for an Ada structured editor.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"377 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Consistent choice narrowing-a new model for constraint based programming","authors":"S. Danforth","doi":"10.1109/HICSS.1988.11857","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11857","url":null,"abstract":"The reasons for the increased interest in constraint-based models of computation are discussed. A model of computation called consistent choice narrowing is introduced. It allows natural representation of useful constraint situations not easily expressed in current programming languages. In particular, unknown functions can be defined by constraint intersection, resulting in higher-order capabilities.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116137527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation and evaluation of a methodology for the stepwise refinement of data","authors":"B. Belkhouche","doi":"10.1109/HICSS.1988.11877","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11877","url":null,"abstract":"Chunk structure has been previously proposed (E. Towster, 1979), as a program design technique to support the stepwise refinement of data structures in parallel with program development. Both the definition of chunk structure and its required support induce new naming structures. The author reports on an initial implementation of chunk structure and describes the basic mechanisms necessary to manage the name space of a program written in a language supporting such a feature. The evaluation of the technique is discussed in the context of design languages.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121017339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Connections in context: the Intermedia systems","authors":"N. Yankelovich, B. J. Haan, S. Drucker","doi":"10.1109/HICSS.1988.11871","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11871","url":null,"abstract":"Intermedia is a hypermedia system developed for use in university research and teaching. It provides a framework for object-oriented, direct-manipulation editors and applications, and the capability to link materials created with those applications. Instructors are able to construct explanatory environments for their students as well as use applications for their day-to-day work, research, and writing. A general discussion of hypermedia is followed by a description of the Intermedia system. The description focuses on several important user-interface features and illustrates the operation of the system through a sample session. It is shown how object-oriented programming techniques and a complementary set of software development tools helped programmers work together and maintain a consistent user-interface throughout the system.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121651441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A consideration of learning in speech recognition from the viewpoint of AI class-description learning","authors":"Y. Takebayashi","doi":"10.1109/HICSS.1988.11870","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11870","url":null,"abstract":"The learning mechanism used in a user-adaptive speech recognizer based on the subspace method is treated. Comparing the subspace learning system with the AI (artificial intelligence) learning system ARCH, the following points are made: (1) subspace learning using covariance matrix modification and KL-expansion is a kind of class-description learning, as found in ARCH. The subspace method focuses on feature extraction for powerful pattern class representation, but does not involve only pattern classification; (2) the concept of near-miss in ARCH can be simulated with the subspace method; (3) M. Minsky's recent (1985) concept 'uniframe', which represents a meaning of a class, is obtained as a subspace with KL-expansion.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133569711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A planner for the automation of programming environment tasks","authors":"R. Bisiani, F. Lecouat, V. Ambriola","doi":"10.1109/HICSS.1988.11789","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11789","url":null,"abstract":"The authors have developed an approach that significantly reduces the time to develop heterogeneous parallel systems. Current, state-of-the-art environments provide most of the necessary tools but leave to the user the task of coordinating the invocation of the tools. They describe a tool, implemented in the Unix environment, that transforms a set of goals and constraints specified by a user into the correct set of tool invocations.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133665599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A knowledge-based approach for real-time systems debugging","authors":"J.P. Tsai, K. Fang, V.R.K. Thalla, H. Gandhi","doi":"10.1109/HICSS.1988.11847","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11847","url":null,"abstract":"The authors consider a method of testing unpredictable sequences known as program execution monitoring. In this method, a snapshot of the system events and happenings are recorded in a noninterfering manner, i.e. without corrupting the critical timing requirements of the target system. The traces thus collected are analyzed to isolate the bug in an offline mode. The examination of voluminous traces is a laborious and tedious task that requires a high degree of expertise. It is shown how this expertise can be encapsulated in a knowledge-based system and the examination process automated to at least localize the fault and answer questions about its reasoning. Such an approach shortens the overall debugging time and contribute toward software productivity and reliability.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"756 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123875913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}