Coalgebraic weak bisimulation from recursive equations over monads
-
Altmetric Citations
Goncharov, Sergey; Pattinson, Dirk
Description
Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing notions are instances of the more general notion of coalgebraic bisimulation. Weak bisimulation, however, has so far been much less amenable to a coalgebraic treatment. Here we attempt to close this gap by giving a coalgebraic treatment of (parametrized) weak...[Show more]
dc.contributor.author | Goncharov, Sergey | |
---|---|---|
dc.contributor.author | Pattinson, Dirk | |
dc.coverage.spatial | Copenhagen Denmark | |
dc.date.accessioned | 2015-12-13T22:29:15Z | |
dc.date.created | July 8-11 2014 | |
dc.identifier.isbn | 9783662439500 | |
dc.identifier.uri | http://hdl.handle.net/1885/74604 | |
dc.description.abstract | Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing notions are instances of the more general notion of coalgebraic bisimulation. Weak bisimulation, however, has so far been much less amenable to a coalgebraic treatment. Here we attempt to close this gap by giving a coalgebraic treatment of (parametrized) weak equivalences, including weak bisimulation. Our analysis requires that the functor defining the transition type of the system is based on a suitable order-enriched monad, which allows us to capture weak equivalences by least fixpoints of recursive equations. Our notion is in agreement with existing notions of weak bisimulations for labelled transition systems, probabilistic and weighted systems, and simple Segala systems. | |
dc.publisher | Springer Verlag | |
dc.relation.ispartofseries | 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 | |
dc.source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.title | Coalgebraic weak bisimulation from recursive equations over monads | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2014 | |
local.identifier.absfor | 100699 - Computer Hardware not elsewhere classified | |
local.identifier.ariespublication | U3488905xPUB4204 | |
local.type.status | Published Version | |
local.contributor.affiliation | Goncharov, Sergey, Friedrich-Alexander Universitat Erlangen-Nurnberg | |
local.contributor.affiliation | Pattinson, Dirk, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 196 | |
local.bibliographicCitation.lastpage | 207 | |
local.identifier.doi | 10.1007/978-3-662-43951-7_17 | |
dc.date.updated | 2015-12-11T08:47:34Z | |
local.identifier.scopusID | 2-s2.0-84904208383 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Goncharov_Coalgebraic_weak_bisimulation_2014.pdf | 251.77 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator