Abstract
A basic property which distributed communicating systems have to fulfill is deadlock-freedom. For systems consisting of the parallel composition of subsystems it is complex to check deadlock-freedom because the global state space of the composition has to be investigated.
This paper presents an approach by which the absence of deadlocks is preserved during the development. Small initial deadlock-free systems are stepwise extended with new functionalities to large complex systems by transformation rules which preserve deadlock-freedom. Systems are represented by finite automata extended with arbitrary local variables. A verification rule is presented which ensures that the parallel composition of such extended automata is deadlock-free. The advantage of this rule is that only information over pairs of connected subsystems is needed and not over the complete state space.
This research was supported by the Leibniz Programme of the Deutsche Forschungsgemeinschaft (DFG) under grant No. Ol 98/1-1
Chapter PDF
References
K.R. Apt, E.-R. Olderog, Verification of Sequential and Concurrent Programs, Springer, New York, 1991
F. Belina, D. Hogrefe, The CCITT-Specification and Description Language SDL, Computer Networks and ISDN Systems 16 (1988/89) 311–341, North-Holland
D. Bjørner, H. Langmaack, C.A.R. Hoare, ProCoS I Final Deliverable, ProCoS Technical Report ID/DTH db 13/1, January 1993
D. Bjørner et al., A ProCoS project description: ESPRIT BRA 3104, Bulletin of the EATCS, 39, 1989
J. Bowen et al., Developing Correct Systems, 5th EuroMicro Workshop on Real-Time Systems, Oulu, Finland, 1993, IEEE Computer Society Press
K.M.Chandy, J. Misra, Parallel Program Design, Addison-Wesley, 1988
K.E. Cheng, Towards a Formal Model for Incremental Service Specification and Interaction Management Support, in L.G. Bouma, H. Veltheuijsen (Eds.), Feature Interactions in Telecommunications Systems, IOS Press, 1994
D. Y. Chao, D. T. Wang, An Interactive Tool for Design, Simulation, Verification, and Synthesis of Protocols, Software — Practice and Experience, Vol. 24(8), 1994
P. Collette, E. Knapp, Logical Foundations for Compositional Verification and Development of Concurrent Programs in UNITY, in VS. Alagar, M. Nivat (Eds.), Proc. Algebraic Methodology and Software Technology '95, LNCS 936 (Springer), 1995
E.W. Dijkstra, Guarded Commands, Nondeterminacy and Formal Derivation of Programs, Communications of the ACM, 18:453–457, 1975
D. Harel, Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming 8, 1987
D. Harel et al., STATEMATE: A Working Environment for the Development of Complex Reactive Systems, IEEE Transactions on Software Engineering, Vol. 16, No. 4, 1990
C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, London, 1985
A. Khoumsi, Detection and Resolution of Interactions between Services of Telephone Networks, internal report IRO 1037, University of Montreal, 1996
S. Kleuker, A Gentle Introduction to Specification Engineering Using a Case Study in Telecommunications, in P. D. Mosses, M. Nielsen, M. I. Schwartzbach, eds., Proc. TAP-SOFT '95, LNCS 915 (Springer), 621–636,1995
S. Kleuker, H. Tjabben, The Incremental Development of Correct Specifications for Distributed Systems, in M.-C. Gaudel, J. Woodcock (eds.), Proc. FME '96, LNCS 1051 (Springer), 1996
S. Kleuker, H. Tjabben, A Formal Approach to the Development of Reliable Multi-User Multimedia Applications, Philips Research Laboratories Aachen, Technical Report, 1168/96, ftp://ftp.informatik.uni-oldenburg.de/pub/procos/cocon/mumu.ps.Z
S. Kleuker, Using Formal Methods in the Development of Protocols for Multi-user Multimedia Systems, in R. Gotzhein und J. Bredereke (eds.), Proc. of FORTE/PSTV'96, Chapman & Hall, 1996
B. Krieg-Brückner, J. Peleska, E.-R. Olderog, D. Balzer, A. Baer, UniForM: Universal Formal Methods Workbench, in Statusseminar des BMBF, Softwaretechnologie, Berlin, March 1996
E.-R. Olderog, Towards a Design Calculus for Communicating Programs, LNCS 527 (Springer), 61–77, 1991
E.-R. Olderog et al., ProCoS at Oldenburg: The Interface between Specification Language and OCCAM-like Programming Language. Technical Report, Bericht 3/92, Univ. Oldenburg, Fachbereich Informatik, 1992
S. Owicki, D. Gries, An Axiomatic Proof Technique for Parallel Programs, Acta Informatica, 6:319–340, 1976
J.M. Spivey, The Z Notation: A Reference Manual, Prentice Hall International Series in Computer Science (2nd edition), 1992
S. Rössig, A Transformational Approach to the Design of Communicating Systems, PhD thesis, University of Oldenburg, 1994
S. Rössig, M. Schenke, Specification and Stepwise Development of Communicating Systems, LNCS 551 (Springer), 1991
Telelogic AB, Malmo, Sweden, SDT 3.01: Users' Guide, 1995
M. Weske, Deadlocks in Computersystemen (in German), International Thomson Publishing, 1995
P. Zafiropulo et al., Towards Analyzing and Synthesizing Protocols, IEEE Transactions on Communications, Vol COM-28, No. 4, April 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kleuker, S. (1997). Incremental development of deadlock-free communicating systems. In: Brinksma, E. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1997. Lecture Notes in Computer Science, vol 1217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035396
Download citation
DOI: https://doi.org/10.1007/BFb0035396
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62790-6
Online ISBN: 978-3-540-68519-7
eBook Packages: Springer Book Archive