Van Horn, Kevin S. (1986) Complete and Infinite Traces: A descriptive model of computing agents. California Institute of Technology . (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1986.5207-tr-86
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 1MB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1986.5207-tr-86
Abstract
A model of computing agents is presented. Computing agents are modeled as processes, which are essentially sets of traces representing possible complete sequences of actions performed by an agent and its environment. Some technical difficulties with infinite traces are resolved, with the result that one may take the parallel composition of any countable set of processes, after possibly renaming some symbols.
| Item Type: | Report or Paper (Technical Report) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1986.5207-tr-86 |
| Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1986.5207-tr-86 |
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
| ID Code: | 26908 |
| Collection: | CaltechCSTR |
| Deposited By: | Imported from CaltechCSTR |
| Deposited On: | 30 Nov 2001 |
| Last Modified: | 03 Oct 2019 03:19 |
Repository Staff Only: item control page
