A graphical model of procedures for an automated manager's assistant
Abstract
A model of office procedures based upon directed graphs is introduced. This model is being used as a basis for work on an office assistant which integrates office procedures performed by individuals and by the assistant. It also provides a framework for an interface to an on-line database system. This paper introduces the basic features of the model, including a set of primitive actions which determine the semantics for the office procedures within the model.
References
[1]
Ellis, C., Nutt, G., "Office Information Systems and Computer Science", ACM Computing Surveys, Vol. 12, No. 1, 1980.
[2]
Ellis, C. A., "Information Control Nets - A Mathematical Model of Office Information Flow", Proceedings of the ACM Conference on Simulation, Measurement and Modelling, Boulder, Colorado, 1979.
[3]
Ellis, C., Gibbons, R., Morris, P., "Office Streamlining", Proceedings of the IFIP TC-6 International Workshop on Integrated Office Systems - Burotics, 1979.
[4]
Estrin, G., Campos, I., "Concurrent software system design, supported by SARA at the age of one", Proceedings Third International Conference on Software Engineering, Atlanta, Georgia, 1978.
[5]
Nutt, G., Ricci, P., "Quinault: An Office Modelling System", Computer, Vol. 14, No. 5, 1981.
[6]
Shu, N., Lum, V., Tung, F., Chang, C., "Specification of Forms Processing and Business Procedures for Office Automation", IBM Research Report RJ3040, 1981.
[7]
Tsichritzis, D. C., "OFS: An Integrated Form Management System", Proceedings Sixth Conference on Very Large Data Bases, Montreal, Canada, 1980.
[8]
Zisman, M. D., Representation, Specification and Automation of Office Procedures, Ph.D. Thesis, Wharton School, University of Pennsylvania, 1977.
[9]
Zloof, M., "QBE/OBE: A Language for Office and Business Automation", Compter, Vol. 14, No. 5, 1981.
Index Terms
- A graphical model of procedures for an automated manager's assistant
Recommendations
Automated Model Building: From Finite to Infinite Models
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer MathematicsWe propose a method for using existing finite model builders for constructing infinite models of first-order formulae. The considered interpretations are represented by tree tuple automata. Our approach is based on formula transformation. It is proven ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1982 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1982
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 277Total Downloads
- Downloads (Last 12 months)29
- Downloads (Last 6 weeks)5
Reflects downloads up to 15 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in