Showing papers by "Grzegorz Rozenberg published in 1989"
Book•
01 May 1989
TL;DR: In this article, a logic for describing behaviours and properties of concurrent systems is proposed for CCS and SCCS and expressibility results for linear-time and branching-time logics are provided.
Abstract: 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.
362 citations
29 May 1989
121 citations
01 Aug 1989
TL;DR: The relationships between a number of behavioural notions that have arisen in the theory of distributed computing are studied in the process of establishing that for each elementary net system, the trace language representation of its behaviour agrees in a strong way with the event structure representation of it behaviour.
Abstract: We study the relationships between a number of behavioural notions that have arisen in the theory of distributed computing. In order to sharpen the understanding of these relationships we apply the chosen behavioural notions to a basic net-theoretic model of distributed systems called elementary net systems. The behavioural notions that are considered here are trace languages, non-sequential processes, unfoldings and event structures. The relationships between these notions are brought out in the process of establishing that for each elementary net system, the trace language representation of its behaviour agrees in a strong way with the event structure representation of its behaviour.
4 citations