rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Handbook of process algebra
  name:
    name part: Bergstra, J. A.
  name:
    name part: Ponse, A. (Alban)
    name part: 1955-
  name:
    name part: Smolka, Scott A.
  name:
    name part: ScienceDirect (Online service)
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: ne
    place:
      place term: Amsterdam
    place:
      place term: New York
    publisher: Elsevier
    date issued: 2001
    edition: 1st ed.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (xiv, 1342 pages) : illustrations
  abstract: Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications.
  table of contents: Preface (Bergstra, Ponse, Smolka). Part 1: Basic Theory. The linear time -- brancing time spectrum I (Van Glabbeek). Trace-oriented models of concurrency (Broy, Olderog). Structural operational semantics (Aceto, Fokkink, Verhoef). Modal logics and mu-calculi: an intorduction (Bradfield, Stirling). Part 2: Finite-State Processes. Process algebra with recursive operations (Bergstra, Fokkink, Ponse). Equivalence and preorder checking for finite-state systems (Cleaveland, Sokolsky). Part 3: Infinite-State Processes. A symbolic approach to value-passing processes (Ingolfsdottir, Lin). An introduction to the pi-calculus (Parrow). Verification on infinite structures (Bukart, Caucal, Moller, Steffen). Part 4: Extensions. Process algebra with timing: real time and discrete time (Baeten, Middelburg). Probabilistic extensions of process algebras (Jonsson, Larsen, Yi). Priority in process algebra (Cleaveland, Luettgen, Natarajan). Part 5: Non-Interleaving Process Algebra. Partial-order process algebra (Baeten, Basten). A unified model for nets and process algebras (Best, Devillers, Koutny). Process algebras with localities (Castellani). Action refinement (Gorrieri, Rensink). Part 6: Tools and Applications. Algebraic process vertification (Groote, Reniers). Discrete time process algebra and the semantics of SDL (Bergstra, Middelburg, Usenko). A process algebra for Interworkings (Mauw, Reniers).
  note: edited by J.A. Bergstra, A. Ponse, S.A. Smolka.
  note: Includes bibliographical references and indexes.
  subject:
    topic: Machine theory
  subject:
    topic: Parallel processing (Electronic computers)
  subject:
    topic: Théorie des automates
  subject:
    topic: Parallélisme (Informatique)
  subject:
    topic: MATHEMATICS
    topic: Infinity
  subject:
    topic: MATHEMATICS
    topic: Logic
  subject:
    topic: Machine theory
  subject:
    topic: Parallel processing (Electronic computers)
  subject:
    topic: Prozessalgebra
  subject:
    topic: Técnicas de programação
  classification: QA267 .H335 2001eb
  classification: 511.3
  related item:
    title info:
      title: Handbook of process algebra
    origin info:
      publisher: Amsterdam ; New York : Elsevier, 2001
      edition: 1st ed.
    identifier: (DLC) 2001023642
    identifier: (OCoLC)46366269
  identifier: 9780444828309
  identifier: 0444828303
  identifier: 9780080533674
  identifier: 0080533671
  identifier: 2001023642
  identifier: 126670:128121 Elsevier Science & Technology
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: OPELS
    record creation date: 070802
    record change date: 20260326150825.0
    record identifier: in00005732006
    language of cataloging:
      language term: eng