The Coarsest Precongruences Respecting Safety and Liveness Properties - Theoretical Computer Science Access content directly
Conference Papers Year : 2010

The Coarsest Precongruences Respecting Safety and Liveness Properties

Abstract

This paper characterises the coarsest refinement preorders on labelled transition systems that are precongruences for renaming and partially synchronous interleaving operators, and respect all safety, liveness, and conditional liveness properties, respectively.
Fichier principal
Vignette du fichier
03230033.pdf (265.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01054444 , version 1 (06-08-2014)

Licence

Attribution

Identifiers

Cite

Robert Jan Glabbeek. The Coarsest Precongruences Respecting Safety and Liveness Properties. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.32-52, ⟨10.1007/978-3-642-15240-5_3⟩. ⟨hal-01054444⟩
61 View
42 Download

Altmetric

Share

Gmail Facebook X LinkedIn More