Abstract
We survey three applications that use finite automata to specify behaviors of concurrent processes in general, and asynchronous circuits in particular. The applications are: verification of concurrent processes, liveness properties, and delay-insensitivity of asynchronous networks. In all three cases, we start with a common model of a nondeterministic finite automaton, and then add certain application-specific features. Typically, the added features involve separating the alphabet or the state set of the automaton into several disjoint subsets. For each application we provide the motivation, describe the type of automaton used, define the most important operations, and state some of the key results. For process verification, we describe a BDD-based tool that implements the respective automata and operations.
This research was supported by the Natural Sciences and Engineering Research Council of Canada under grant No. OGP0000871, and by an Ontario Graduate Scholarship
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Black, D. L.: On the existence of delay-insensitive fair arbiters: trace theory and its limitations. Distributed Computing 1 (1986) 205–225
Brace, K. S., Rudell, R. L., and Bryant, R. E. Efficient implementation of a BDD package. Proceedings of the 27th ACM/IEEE Design Automation Conference (1990) 40–45
Bryant, R. E: Graph based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35 (1986) 677–691
Brzozowski, J. A., Seger, C-J. H.: Asynchronous Circuits. Springer-Verlag, 1995
Brzozowski, J. A., Zhang, H.. Delay-Insensitivity and Semi-Modularity. Research Report CS-97-11 (1997) Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, 1974
Mimer, R.: Communication and Concurrency. Prentice Hall, 1989
Moore E. F.: Gedanken Experiments on Sequential Machines. Automata Studies, Annals of Mathematics Studies 34 (1956) 129–153
Negulescu., R.: Process Spaces. Research Report CS-95-48 (1995) Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Negulescu, R.: A Technique for Finding and Verifying Speed-Dependences in Gate Circuits. Research Report CS-97-28 (1997) Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Negulescu, R., Brzozowski, J. A.: Relative liveness: from intuition to automated verification. Formal Methods in System Design (to appear)
Udding, J. T.: Classification and Composition of Delay-Insensitive Circuits. PhD Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1984
Udding, J. T.: A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing 1 (1986) 197–204
Zhang, H.: Delay-Insensitive Networks. MMath Thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1997
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brzozowski, J.A., Negulescu, R. (1998). Automata of asynchronous behaviors. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031379
Download citation
DOI: https://doi.org/10.1007/BFb0031379
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive