Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988

This volume is based on the "School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency" organized by the editors and held in the period May 30-June 3, 1988 at Noordwijkerhout, The Netherlands. The School/Workshop was an activity of the project RE...

Full description

Bibliographic Details
Other Authors: Bakker, Jacobus W. de (Editor), Roever, Willem-Paul de (Editor), Rozenberg, Grzegorz (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1989, 1989
Edition:1st ed. 1989
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Time, logic and computation
  • Process theory based on bisimulation semantics
  • Branching time temporal logic
  • Observing processes
  • The anchored version of the temporal framework
  • Basic notions of trace theory
  • An introduction to event structures
  • A logic for the description of behaviours and properties of concurrent systems
  • Permutation of transitions: An event structure semantics for CCS and SCCS
  • Expressibility results for linear-time and branching-time logics
  • Partial orderings descriptions and observations of nondeterministic concurrent processes
  • Modeling concurrency by partial orders and nonlinear transition systems
  • An efficient verification method for parallel and distributed programs
  • A logic for distributed transition systems
  • Fully abstract models for a process language with refinement
  • Strong bisimilarity on nets: A new concept for comparing net semantics
  • Nets of processes and data flow
  • Towards a temporal logic for causality and choice in distributed systems
  • Correctness and full abstraction of metric semantics for concurrency
  • Temporal logics for CCS
  • Behavioural presentations
  • Computation tree logic and regular ?-languages