Unifying the linear time-branching time spectrum of process semantics

DOI10.2168/LMCS-9(2:11)2013zbMATH Open1297.68181arXiv1304.6574OpenAlexW2071532102MaRDI QIDQ2838240FDOQ2838240

Authors: David de Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino, David Romero Hernández 

Publication date: 9 July 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1304.6574

Recommendations

• On the Unification of Process Semantics: Observational Semantics
• On the unification of process semantics: logical semantics
• On the unification of process semantics: equational semantics
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Branching vs. Linear Time: Semantical Perspective

zbMATH Keywords

unificationaxiomatizationsprocess semanticslinear semanticslinear time-branching time spectrumalgebraic languagesconstrained simulationsimulation semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (18)

• When are prime formulae characteristic?
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONCUR 2005 – Concurrency Theory
• Towards bialgebraic semantics for the linear time -- branching time spectrum
• Branching vs. Linear Time: Semantical Perspective
• On the unification of process semantics: logical semantics
• An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
• Logical characterisations and compositionality of input-output conformance simulation
• Encoding safety in \(\mathrm{CLL}_R\)
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• On the Unification of Process Semantics: Observational Semantics
• A linear-time-branching-time spectrum for behavioral specification theories
• A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
• Preorder-constrained simulations for program refinement with effects
• When are prime formulae characteristic?
• Logical characterisations, rule formats and compositionality for input-output conformance simulation
• Title not available (Why is that?)

This page was built for publication: Unifying the linear time-branching time spectrum of process semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2838240)