Abstract
This paper presents a mechanical technique which allows behavioural equivalence proof between (nondeterministic) finite-state machines (FSMs). Given a pair of FSMs which are recursively described in the syntax of a process algebra, a third FSM which represents the concurrent behaviour of the two original FSMs is constructed. An algorithm is engineered for comparing the two FSMs against this third concurrent FSM. A self-evident proof of the equivalence between the FSMs will be produced; if the two FSMs are not equivalent, a sequnce of events will be returned which distinguishes between them.
Supported in part by the EEC under contract ESPRIT BRA 3216 “CHARME”
Supported by a University of Strathclyde Postgraduate Studentship
Chapter PDF
Similar content being viewed by others
Keywords
- Label Transition System
- Process Algebra
- Deterministic Process
- Structure Operational Semantic
- Internal Choice
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A.V. Aho, J. E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Series in Computer Science and Information Processing. Addison-Wesley, Reading, MA, 1983.
A. Bailey, G.A. McCaskill, J. McIntosh, and G.J. Milne. The description and automatic verification of digital circuits in CIRCAL. In Advanced Research Workshop on Correct Hardware Design Methodologies, pages 265–280, Turin, Italy, June 1991.
J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation, 60(1/3), 1984.
R. Cleaveland and M.C.B. Hennessy. Testing equivalence as a bisimulation equivalence. In J. Sifakis, editor, Lecture Notes in Computer Science 407, pages 11–23. Springer-Verlag, 1989.
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench. In J. Sifakis, editor, Lecture Notes in Computer Science 407, pages 24–37. Springer-Verlag, 1989.
R. de Nicola and M.C.B. Hennessy. Testing equivalence for processes. Theoretical Computer Science, 34(1 and 2), 1984.
R. de Nicola, P. Inverardi, and M. Nesi. Using the axiomatic presentation of behavioural equivalences for manipulating ces specifications. In J. Sifakis, editor, Lecture Notes in Computer Science 407, pages 54–67. Springer-Verlag, 1989.
M.C.B. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988.
M.C.B. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Jounal of the Association of Computing Machinery, 32(1):137–161, 1985.
M. Hillerstöm. Verification of CCS-Processes. PhD thesis, Aalborg University Centre, Denmark, 1987. R 87–27.
C.A.R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice Hall International, 1985.
P. Inverardi and M. Nesi. A rewriting strategy to verify observational congruence. Information Processing Letters, 35:191–199, 1990.
P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43–68, May 1990.
K.G. Larsen. Proof systems for hennessy-milner logic with recursion. Jounal of Theoretical Computer Science, 72:265–288, 1990.
L.S. Levy. Fundamental Concepts of Computer Science, Methematical Foundations of Programming. Dorset House Publishing, 1988.
G.J. Milne. The representation of communication and concurrency. Technical Report 4088, Caltech, 1980.
G.J. Milne. Circal: A calculus for circuit description. Integration, the VLSI Journal, 1(2,3):121–160, 1983.
G.J. Milne. Circal and the representation of communication, concurrency and time. ACM Transactions on Programming Languages and Systems, 7(2), 1985.
R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall International, 1989.
F.G. Moller. The semantics of Circal. Technical Report HDV-3-89, University of Strathclyde, Department of Computer Science, Glasgow, Scotland, 1989.
D. Park. Concurrency and automata in infinite strings. In Lecture Notes in Computer Science 104, pages 167–183. Springer-Verlag, 1981.
G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Computer Science Dept, Aarhus Univ, Denmark, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mao, W., Milne, G.J. (1992). An automated proof technique for finite-state machine equivalence. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive