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
Modal Logics for Nominal Transition Systems
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)ORCID iD: 0000-0001-5990-5742
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)
Show others and affiliations
2019 (English)In: Article in journal (Refereed) Submitted
Abstract [en]

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for these systems is introduced, and proved adequate and expressively complete for bisimulation equivalence. A main technical novelty is the use of finitely supported infinite conjunctions. We show how to treat different bisimulation variants such as early, late, open and weak in a systematic way, explore the folklore theorem that state predicates can be replaced by actions, and make substantial comparisons with related work. The main definitions and theorems have been formalised in Nominal Isabelle.

Place, publisher, year, edition, pages
2019.
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-383314OAI: oai:DiVA.org:uu-383314DiVA, id: diva2:1315378
Available from: 2019-05-13 Created: 2019-05-13 Last updated: 2019-05-24Bibliographically approved

Open Access in DiVA

fulltext(700 kB)10 downloads
File information
File name FULLTEXT01.pdfFile size 700 kBChecksum SHA-512
f254618b93592a0b6a1003eaa682117dc55875ec023797cf3ca8c84bc011d60891a09d9a6b4b7d2526e7492ce94a249bfa55a8464686a22e84556894f6fd10d3
Type fulltextMimetype application/pdf

Other links

https://arxiv.org/abs/1904.02564

Search in DiVA

By author/editor
Parrow, JoachimBorgström, JohannesEriksson, Lars-HenrikGutkovas, RamunasWeber, Tjark
By organisation
Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 10 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

urn-nbn

Altmetric score

urn-nbn
Total: 37 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