The University of Southampton
University of Southampton Institutional Repository

Syntactic formats for free: an abstract approach to process equivalence

Syntactic formats for free: an abstract approach to process equivalence
Syntactic formats for free: an abstract approach to process equivalence
A framework of Plotkin and Turi's, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee that various operational preorders are precongruences. The technique is applied to the trace preorder, the completed trace preorder and the failures preorder. In the latter two cases, new syntactic formats guaranteeing precongruence properties are introduced.
syntactic formats, abstrac gsos, coalgebras
72-86
Klin, B
1e1e923f-ac7d-4b7e-8c2c-66040a8a3a45
Sobocinski, P
439334ab-2826-447b-9fe5-3928be3fd4fd
Amadio, R
35950e11-0ed2-43cd-9f76-60fb44b24816
Lugiez, D
7f99a359-4855-4887-b3dd-7b99b85c7c19
Klin, B
1e1e923f-ac7d-4b7e-8c2c-66040a8a3a45
Sobocinski, P
439334ab-2826-447b-9fe5-3928be3fd4fd
Amadio, R
35950e11-0ed2-43cd-9f76-60fb44b24816
Lugiez, D
7f99a359-4855-4887-b3dd-7b99b85c7c19

Klin, B and Sobocinski, P (2003) Syntactic formats for free: an abstract approach to process equivalence. Amadio, R and Lugiez, D (eds.) Concur '03, Marseille, France. 02 - 04 Sep 2003. pp. 72-86 .

Record type: Conference or Workshop Item (Paper)

Abstract

A framework of Plotkin and Turi's, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee that various operational preorders are precongruences. The technique is applied to the trace preorder, the completed trace preorder and the failures preorder. In the latter two cases, new syntactic formats guaranteeing precongruence properties are introduced.

This record has no associated files available for download.

More information

Published date: 2003
Additional Information: Event Dates: September 3-5, 2003
Venue - Dates: Concur '03, Marseille, France, 2003-09-02 - 2003-09-04
Keywords: syntactic formats, abstrac gsos, coalgebras
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 263501
URI: http://eprints.soton.ac.uk/id/eprint/263501
PURE UUID: 181aec5c-d62e-4c2d-a413-1e928e4fa36e

Catalogue record

Date deposited: 19 Feb 2007
Last modified: 08 Jan 2022 05:49

Export record

Contributors

Author: B Klin
Author: P Sobocinski
Editor: R Amadio
Editor: D Lugiez

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×