Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The largest respectful function
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Concurrency)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Concurrency)
2016 (English)In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 12, no 2, article id 11Article in journal (Refereed) Published
Abstract [en]

Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier the bisimulation proof. In particular the largest respectful function, defined as the pointwise union of all respectful functions, has been shown to be very useful. We here provide an explicit and constructive characterization of it.

Place, publisher, year, edition, pages
2016. Vol. 12, no 2, article id 11
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-307352DOI: 10.2168/LMCS-12(2:11)2016ISI: 000389145600012OAI: oai:DiVA.org:uu-307352DiVA, id: diva2:1046296
Available from: 2016-06-29 Created: 2016-11-13 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(140 kB)66 downloads
File information
File name FULLTEXT01.pdfFile size 140 kBChecksum SHA-512
4e6f266dc0c287c88b55440ef9650e30f95b2b52c51ce40339646b3fda84cef1e5e998d6b02df6e9fc614f1e299812acda9f45bdaa3ccd2bcfee590c57cc6408
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Parrow, JoachimWeber, Tjark
By organisation
Computing Science
In the same journal
Logical Methods in Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 66 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 344 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf