On the Unification of Process Semantics: Logical Semantics

@inproceedings{RomeroHernndez2011OnTU,
  title={On the Unification of Process Semantics: Logical Semantics},
  author={David Romero-Hern{\'a}ndez and David de Frutos-Escrig},
  booktitle={SOS},
  year={2011}
}
We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. We start by considering the classic linear time-branching time spectrum developed by R.J. van Glabbeek. He provided a logical characterization of most of the semantics in his spectrum but, without following a unique pattern. In this paper, we present a uniform logical characterization of all the semantics in the enlarged spectrum. The common… 

Figures and Tables from this paper

Unifying the Linear Time-Branching Time Spectrum of Process Semantics

This paper brings forward a refinement of van Glabbeek's linear time-branching time spectrum and shows how the process semantics can be dealt with in a uniform way, based on the very natural concept of constrained simulation.

Más sobre equivalencias lógicas y distancias entre procesos

Esta tesis se enmarca en el amplio campo de la teoria de la concurrencia. Mas especificamente, nos centramos en el estudio de las relaciones de similitud entre procesos concurrentes. Comenzamos

References

SHOWING 1-10 OF 12 REFERENCES

On the Unification of Process Semantics: Observational Semantics

This study rediscovers the classification in van Glabbeek's spectrum and sheds light on it, obtaining a framework where all the semantics in the spectrum at the same time are considered, and discovers some "lost links" that correspond to semantics that provide a clearer picture of the spectrum.

Universal Coinductive Characterisations of Process Semantics

A theoretical framework which allows to define in a uniform way coinductive characterisations of nearly any semantic preorder or equivalence between processes, by means of simulations up- to and bisimulations up-to, and proves that each constrained simulation preorder defines a class of process preorders which share commons properties.

Universal Coinductive Characterisations of Process Semantics

A theoretical framework which allows to define in a uniform way coinductive characterisations of nearly any semantic preorder or equivalence between processes, by means of simulations up- to and bisimulations up-to, and proves that each constrained simulation preorder defines a class of process preorders which share commons properties.

Ready simulation for concurrency: It's logical!

The Linear Time - Branching Time Spectrum II

This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time

Safe reasoning with Logic LTS

The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR

In this paper various semantics in the linear time { branching time spectrum are presented in a uniform, model-independent way and the classiication of some useful process semantics can be facilitated by drawing parts of this lattice and locating the positions of some interesting process semantics, found in the literature.

Algebraic laws for nondeterminism and concurrency

The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.