Abstract
Message management systems with facilities for the automatic processing of messages can exhibit anomalous behaviour such as infinite loops and deadlock. In this paper we present some methods for analyzing the behaviour of these systems by generating expressions of message flow from the procedure specifications. Message domains are partitioned into state spaces, and procedures can be interpreted as automata effecting state changes. Blocking of procedures and procedure loops can then be detected by studying the resulting finite automaton and Petri net representations of message flow.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[AhHU74]
[AtBS79]
[BoMu76]
[ElNu80]
[HaSi80]
[KaMi69]
[Nier84]
[PaSt82]
[Pete83]
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nierstrasz, O.M. (1985). Message Flow Analysis. In: Tsichritzis, D.C. (eds) Office Automation. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82435-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-82435-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82437-1
Online ISBN: 978-3-642-82435-7
eBook Packages: Springer Book Archive