A Markov Model of Cyclic Structured Programs

dc.contributor.authorWesselkamper, Thomas C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:01Zen
dc.date.available2013-06-19T14:37:01Zen
dc.date.issued1977en
dc.description.abstractThe paper defines a class of flow graphs which possess neither absorbing nor transient states. It gives a necessary and sufficient condition that any transition matrix associated with such a program be primitive. With a fixed flowgraph is associated an equivalence class of programs and an equivalence class of transition matrices. The paper investigates the hypothesis that the equivalence class of processes generated by the programs is modeled by the behavior of the equivalence class of eigenvectors generated by the transition matrices. The geometric implications are considered as well as the statistical behavior of the model as applied to the first fourteen algorithms of the Communications of the ACM.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000818/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000818/01/CS77002-R.pdfen
dc.identifier.trnumberCS77002-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20297en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleA Markov Model of Cyclic Structured Programsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
CS77002-R.pdf
Size:
625.53 KB
Format:
Adobe Portable Document Format