Verification of Process Structures of Interacting Digital Systems
File(s)
Date
1973Author
Johnson, R.T.
Fitzwater, D.R.
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Metadata
Show full item recordAbstract
A formal, universe for systems design has been developed, in which representations of interacting digital, systems are interpreted by a deterministic automaton acting on state information in the form of character
strings. Since process structures in this universe can be described with regular languages, a new interpretation is defined in which regular languages represent state information. Computations under this new hterpretation contain the previous ones (with some loss of detail), making it possible to prove assertions about the origina1 string computations. An example is given to show the formulation, and algorithmic verification, of some interesting properties of two asynchronous communicating systems.
Permanent Link
http://digital.library.wisc.edu/1793/57830Citation
TR193