Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency

ISBN 10: 354051080X / ISBN 13: 9783540510802

Editore: Springer, 1989

Riguardo questo articolo

pp. 728.

Codice articolo 261763425

Dati bibliografici

• Titolo: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
• Editore: Springer
• Data di pubblicazione: 1989
• Lingua: Inglese
• ISBN 10: 354051080X
• ISBN 13: 9783540510802
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

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 REX - Research and Education in Concurrent Systems. The volume contains tutorials and research contributions to the three approaches - linear time, - branching time, and - partial order in semantics and proof theory of concurrent programs by the main specialists in this field. It promotes an in-depth understanding of the relative merits and disadvantages of these three approaches. An introduction to the recent literature on the subject is provided by the invited research contributions.

Contenuti

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.