Abstract
A scalechart is a set of statecharts, operating in a dense time domain, whose behavior is self-similar at different scales. The simplicity of extracting proofs of behavior from scalecharts is demonstrated, based on the < and co relationships. An algorithm is presented which automatically extracts < relationships from a simplified version of scalecharts.
This is a preview of subscription content, log in via an institution to check access.
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
Bosworth, R.: Scalecharts - Self-similar Statecharts in a Dense Time Domain. To be published in Software and Systems Modelling, Springer, Heidelberg (2004)
Harel, D.: Statecharts: a Visual Formalism for Complex Systems. Science of Computer Programming 8, 231–274 (1987)
Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Comm. A.C.M. 21, 558–565 (1978)
Shields, M.W.: Semantics of Parallelism. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bosworth, R. (2004). Automatic Proofs for Scalecharts. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds) Diagrammatic Representation and Inference. Diagrams 2004. Lecture Notes in Computer Science(), vol 2980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25931-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-25931-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21268-3
Online ISBN: 978-3-540-25931-2
eBook Packages: Springer Book Archive