Abstract
We outline a modular method for specifying and proving safety properties about distributed systems. Data flow networks represent such systems. They are composed of encapsulated units cooperating by asynchronous message passing. The components of such networks are data flow nodes with a black box behavior specified by relations on the communication histories formed by the streams of the input/output channels. State machines described by state transition rules with input and output implement system components. Vice versa, history relations provide an abstraction of state machines. Safety properties are captured by system invariants that help to prove properties about state machines. Our approach provides a bridge from state-based system models defined by state transitions to the more abstract history views on systems and their components.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abadi, M., Lamport, L.: Composing Specifications. Digital Systems Research Center, SRC Report 66 (October 1990)
Breitling, M., Philipps, J.: Black Box View of State Machines. TUM-19916, SFB-Bericht Nr. 34L/07/99A, Institut für Informatik, Technische Universität München (1999)
Broy, M.: Compositional Refinement of Interactive Systems. In: DIGITAL Systems Research Center, SRC 89 (1992); Also in: Journal of the ACM 44(6), 850-891 (November 1997)
Broy, M.: The Specification of System Components by State Transition Diagrams. Technische Universität München, Institut für Informatik, TUM-I9729, Mai (1997 )
Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison Wesley, Reading (1988)
Rock, G., Stephan, W., Wolpers, A.: Modular Reasoning about Structured TLA Specifications. In: Berghammer, R., Lakhnech, Y. (eds.) Tool Support for System Specification, Development and Verification. Advances in Computing Science, pp. 217–229. Springer, NewYork (1999)
Paech, B.R.: A new Concept of Refinement used for Behaviour Modelling with Automata. In: Naftalin, M., Denvir, T., Bertran, M. (eds.) FME 1994. LNCS, vol. 873. Springer, Berlin (1994)
Rumpe, B., Klein, C.: Automata Describing Object Behavior. In: Kilov, H., Harvey, W. (eds.) Specification of Behavioral Semantics in Object-Oriented Information Modeling, pp. 265–286. Kluwer Academic Publishers, Dordrecht (1996)
Scholz, P., Nazareth, D., Regensburger, F.: Mini-Statecharts: A Compositional Way to Model Parallel Systems. In: 9th International Conference on Parallel and Distributed Computing Systems, Dijon, France, September 25-27 (1996)
Björner, N.S., Browne, A., Chang, E., Colon, M., Kapur, A., Manna, Z., Sipma, H.B., Uribe, T.E.: STeP: The Stanford Temporal Prover, User’s Manual. Technical Report STAM-CS-TR-95-1562, Computer Science Department. Stanford University (November 1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broy, M. (2000). From States to Histories. In: Bert, D., Choppy, C., Mosses, P.D. (eds) Recent Trends in Algebraic Development Techniques. WADT 1999. Lecture Notes in Computer Science, vol 1827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44616-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-44616-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67898-4
Online ISBN: 978-3-540-44616-3
eBook Packages: Springer Book Archive