000 | 03895nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-73938-8 | ||
003 | DE-He213 | ||
005 | 20161121230615.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540739388 _9978-3-540-73938-8 |
||
024 | 7 |
_a10.1007/978-3-540-73938-8 _2doi |
|
050 | 4 | _aQA76.9.A73 | |
050 | 4 | _aQA76.9.S88 | |
072 | 7 |
_aUYD _2bicssc |
|
072 | 7 |
_aCOM032000 _2bisacsh |
|
072 | 7 |
_aCOM067000 _2bisacsh |
|
082 | 0 | 4 |
_a003.3 _223 |
100 | 1 |
_aFokkink, Wan. _eauthor. |
|
245 | 1 | 0 |
_aModelling Distributed Systems _h[electronic resource] / _cby Wan Fokkink. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
300 |
_aVIII, 154 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTexts in Theoretical Computer Science An EATCS Series, _x1862-4499 |
|
505 | 0 | _aAbstract Data Types -- Process Algebra -- Hiding Internal Transitions -- Protocol Specifications -- Linear Process Equations -- Verification Algorithms on State Spaces -- Symbolic Methods. | |
520 | _aA distributed system is driven by separate components that are executed in parallel, and protocols for such systems form a major aspect of system design in today’s world of wireless and mobile networking. Process algebras are languages for the description of elementary parallel systems and are used to study the behavioural properties of distributed systems, but they often lack the ability to handle data. This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verification techniques. The author employs µCRL as the vehicle, a language developed to combine process algebra and abstract data types. Chapters 2 and 3 explain the basics of abstract data types and process algebra, and guide the reader through the syntax and semantics of µCRL; Chap. 4 examines abstraction from internal behaviour; Chap. 5 covers specifications of standard protocols; Chap. 6 shows how to transform protocol specifications into labelled transition systems; Chap. 7 explains algorithms on labelled transition systems; and Chap. 8 presents symbolic verification techniques; finally, the Appendix gives a brief overview of the µCRL toolset. The book evolved from introductory courses on protocol verification taught to undergraduate and graduate students of computer science, and the text is supported throughout with examples and exercises; full solutions are provided in an appendix, while exercise sheets, lab exercises, example specifications and lecturer slides will be available on the author's website. Researchers in the field can use the book as a broad overview of the state of the art in algebraic specification and verification of distributed systems on the basis of a modern verification tool. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aArchitecture, Computer. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputers. | |
650 | 0 | _aComputer logic. | |
650 | 0 | _aMathematical logic. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer System Implementation. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aTheory of Computation. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540739371 |
830 | 0 |
_aTexts in Theoretical Computer Science An EATCS Series, _x1862-4499 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-73938-8 |
912 | _aZDB-2-SCS | ||
950 | _aComputer Science (Springer-11645) | ||
999 |
_c501287 _d501287 |