Ready to preorder: the case of weak process semantics
type: Item
instance of: scholarly article
title: Ready to preorder: the case of weak process semantics
zbMATH Open document ID: 1191.68434
author: Taolue Chen
author: Wan Fokkink
author: Rob van Glabbeek
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
full work available at URL: https://unsworks.unsw.edu.au/fapi/datastream/unsworks:7777/SOURCE01
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5719247
zbMATH Keywords: concurrency
zbMATH Keywords: process algebra
zbMATH Keywords: weak process semantics
MaRDI profile type: Publication
OpenAlex ID: W2038305454
cites work: Ready to Preorder: Get Your BCCSP Axiomatization for Free!
cites work: Q3601881
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: A Theory of Communicating Sequential Processes
cites work: On finite alphabets and infinite bases
cites work: (Bi)simulations up-to characterise process semantics
cites work: Ready to preorder: an algebraic and general proof
cites work: Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
cites work: Testing equivalences for processes
cites work: Notes on the methodology of CCS and CSP
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Q3992568
DOI: 10.1016/J.IPL.2008.09.003
description: scientific article; zbMATH DE number 5719247