RT Journal Article
T1 Unifying the linear time-branching time spectrum of strong process semantics
A1 Frutos Escrig, David De
A1 Gregorio Rodríguez, Carlos
A1 Palomino Tarjuelo, Miguel
A1 Romero Hernández, David
AB Van Glabbeek's linear time-branching time spectrum is one of the most relevant work on comparative study on process semantics, in which semantics are partially ordered by their discrimination power. In this paper we bring forward a refinement of this classification and show how the process semantics can be dealt with in a uniform way: based on the very natural concept of constrained simulation we show how we can classify the spectrum in layers; for the families lying in the same layer we show how to obtain in a generic way equational, observational, logical and operational characterizations; relations among layers are also very natural and differences just stem from the constraint imposed on the simulations that rule the layers. Our methodology also shows how to achieve a uniform treatment of semantic preorders and equivalences.
PB Tech Univ Braunschweig, Inst Theoretical Computer Sci
SN 1860-5974
YR 2013
FD 2013
LK https://hdl.handle.net/20.500.14352/33355
UL https://hdl.handle.net/20.500.14352/33355
LA eng
NO Frutos Escrig, D., Gregorio Rodríguez, C., Palomino Tarjuelo, M. & Romero Hernández, D. «Unifying the Linear Time-Branching Time Spectrum of Process Semantics». Logical Methods in Computer Science, vol. Volume 9, Issue 2, junio de 2013, p. 983. DOI.org (Crossref), https://doi.org/10.2168/LMCS-9(2:11)2013.
NO Comunidad de Madrid
NO Ministerio de Educación, Formación Profesional y Deportes (España)
DS Docta Complutense
RD 21 abr 2025