A Markov Model of Certain Structured Programs
| dc.contributor.author | Wesselkamper, Thomas C. | en |
| dc.contributor.author | Zoladz, Richard W. | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2013-06-19T14:36:44Z | en |
| dc.date.available | 2013-06-19T14:36:44Z | en |
| dc.date.issued | 1976 | en |
| dc.description.abstract | The 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.mimetype | application/pdf | en |
| dc.identifier | http://eprints.cs.vt.edu/archive/00000810/ | en |
| dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000810/01/CS76004-R.pdf | en |
| dc.identifier.trnumber | CS76004-R | en |
| dc.identifier.uri | http://hdl.handle.net/10919/20279 | en |
| dc.language.iso | en | en |
| dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
| dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.title | A Markov Model of Certain Structured Programs | en |
| dc.type | Technical report | en |
| dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1