Show simple item record

dc.contributor.authorWesselkamper, Thomas C.en
dc.contributor.authorZoladz, Richard W.en
dc.date.accessioned2013-06-19T14:36:44Zen
dc.date.available2013-06-19T14:36:44Zen
dc.date.issued1976en
dc.identifierhttp://eprints.cs.vt.edu/archive/00000810/en
dc.identifier.urihttp://hdl.handle.net/10919/20279en
dc.description.abstractThe paper is concerned with modeling the run time behavior of a certain class of programs. Each program, represented by its flowgraph, is built up from one-in/one-out constructs (after the manner of Dijkstra). The programs have neither transient states nor absorbing states. Each program has one state which possesses two cycles of relatively prime length. A program which possesses these properties is called regular. Such a program may he modeled by a finite Markov chain. It is shown that if a program is regular then its Markov model has a regular transition matrix, that is, the sequence of powers of the transition matrix converges to a matrix all of whose rows are identical. The experimental validity of the method is discussed, as are the implications of the method for program design.en
dc.format.mimetypeapplication/pdfen
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 Certain Structured Programsen
dc.typeTechnical reporten
dc.contributor.departmentComputer Scienceen
dc.identifier.trnumberCS76004-Ren
dc.type.dcmitypeTexten
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000810/01/CS76004-R.pdfen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record