Titlebook: Semantics of Systems of Concurrent Processes; LITP Spring School o Irène Guessarian Conference proceedings 1990 Springer-Verlag Berlin Heid

Measured

Action versus state based logics for transition systems,erve truth. A branching time version of the action based logic is also introduced. This new logic for transition systems can play an important role as an intermediate between Hennessy-Milner Logic and the modal μ-calculus. It is sufficiently expressive to describe safety and liveness properties but permits model checking in linear time.

充满装饰

0302-9743 papers are of two kinds: - surveys and tutorials introducing the subject to novices and students and giving updates of the state of the art, - research papers presenting recent achievements in the semantics of concurrency. The contributions explicate the connections, similarities and differences be

lambaste

旧石器时代

Fault-tolerant naming and mutual exclusion,vior..We first study the naming problem (how to give each site of a network an unique identifier). We are naturally led to make some supplementary assumptions about the synchrony of message passing, the connectivity of the underlying graph and the existence of a special site, provided with a digital

名义上

Towards a semantic approach to SIMD architectures and their languages,t semantics of parallel languages designed to control those architectures in their various aspects. In this paper, we concentrate on the duality between the macroscopic view of SIMD architectures (a sequential processor operating on array variables), and the microscopic one (an array of parallel pro

Spinal-Fusion

Concerning the size of clocks,ocesses if causal independence is to be characterized. In this paper we have shown that smaller clocks do not work if we just know the number of processes. Then using theorems about the dimension of partially ordered sets we have given a mathematical interpretation of this result..Finally we would l

清晰

编辑才信任

Causal trees interleaving + causality,e actions, thus providing us with an interleaving description of concurrent systems which faithfully expresses causality. This model borrows from the interleaving models most of their mathematical simplicity and enhances their descriptive power. Actually, Labelled Event Structures can be easily tran

fluoroscopy

嬉耍

Equivalences and refinement, of possible runs as well as “branching time” approaches where the conflict structure of systems is taken into account. We show that the usual interleaving equivalences, and also the equivalences based on . (multisets of concurrently executed actions) are not preserved by refinement of actions. We p