Abstract
Distributed, concurrent, and reactive systems, are playing an increasingly important role in computer science, both in theory and in practice. Software systems with these characteristics, among them communication protocols, database systems, and operating systems, tend to exhibit a rich set of behaviours, are inherently complex and therefore complicated to build. Consequently, a great deal of work has been done investigating formal techniques supporting the correct construction of concurrent systems, as well as their verification. The latter is often of particular interest, since concurrent systems are being used in e.g. safety-critical control systems and arise in the design of digital circuits. Verification can then be applied to guarantee that central aspects of the intended system behaviour, like e.g. safety or liveness properties, are correct with respect to their specifications. In contrast to pure testing, this methodology has the important benefit that it directly supports early error detection by revealing logical errors already in the design phase, as well as that it increases considerably the confidence into the correctness of the produced software.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1997). Introduction. In: Automatic Verification of Sequential Infinite-State Processes. Lecture Notes in Computer Science, vol 1354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69678-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-69678-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63982-4
Online ISBN: 978-3-540-69678-0
eBook Packages: Springer Book Archive