A general conservative extension theorem in process algebras with inequalities
type: Item
instance of: scholarly article
title: A general conservative extension theorem in process algebras with inequalities
zbMATH Open document ID: 0901.68111
DOI: 10.1016/S0304-3975(96)00292-7
author: P. R. D'Argenio
author: Chris Verhoef
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1178546
zbMATH Keywords: transition system
MaRDI profile type: Publication
cites work: Observation equivalence as a testing equivalence
cites work: On relating concurrency and nondeterminism
cites work: Turning SOS rules into equations
cites work: Q4013244
cites work: Real time process algebra
cites work: Discrete time process algebra
cites work: Q4727412
cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
cites work: Global renaming operators in concrete process algebra
cites work: Process Algebra
cites work: Q4525274
cites work: Process algebra for synchronous communication
cites work: Algebra of communicating processes with abstraction
cites work: Bisimulation can't be traced
cites work: The meaning of negative premises in transition system specifications
cites work: Q4490741
cites work: Concurrency and atomicity
cites work: OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES
cites work: A conservative look at operational semantics with variable binding
cites work: Q4116038
cites work: Transition system specifications with negative premises
cites work: Structured operational semantics and bisimulation as a congruence
cites work: Q3997501
cites work: Q3336736
cites work: Q4278673
cites work: A complete inference system for a class of regular behaviours
cites work: Q3992568
cites work: The algebra of timed processes, ATP: Theory and application
cites work: Q3727392
cites work: Q3907077
cites work: Q3657409
cites work: ACP '95, international workshop on Algebra of communicating processes. Eindhoven, Netherlands, May 17--18, 1995
cites work: Q3753475
cites work: Q4818861
cites work: Branching time and abstraction in bisimulation semantics
cites work: Q4847024
cites work: The algebra of communicating processes with empty process
cites work: Bisimulation and divergence
cites work: Q4002149
cites work: Q4847000
full work available at URL: s0304-3975(96)00292-7
OpenAlex ID: W1946227193
description: scientific article; zbMATH DE number 1178546