Reasoning About Bounds in Weighted Transition Systems

We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates states that exhibit transitions to bisimulation classes with...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 14, Issue 4
Main Authors: Hansen, Mikkel, Larsen, Kim Guldstrand, Mardare, Radu, Pedersen, Mathias Ruggaard
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science e.V 01.01.2018
Subjects:
computer science - formal languages and automata theory
computer science - logic in computer science
f.1.1
f.4.1
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates states that exhibit transitions to bisimulation classes with the weights within the same boundaries. We propose a customized modal logic that expresses these numeric boundaries for transition weights by means of particular modalities. We prove that our logic is invariant under the proposed notion of bisimulation. We show that the logic enjoys the finite model property and we identify a complete axiomatization for the logic. Last but not least, we use a tableau method to show that the satisfiability problem for the logic is decidable.
AbstractList We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates states that exhibit transitions to bisimulation classes with the weights within the same boundaries. We propose a customized modal logic that expresses these numeric boundaries for transition weights by means of particular modalities. We prove that our logic is invariant under the proposed notion of bisimulation. We show that the logic enjoys the finite model property and we identify a complete axiomatization for the logic. Last but not least, we use a tableau method to show that the satisfiability problem for the logic is decidable.
Author Larsen, Kim Guldstrand
Mardare, Radu
Pedersen, Mathias Ruggaard
Hansen, Mikkel
Author_xml – sequence: 1
  givenname: Mikkel
  orcidid: 0000-0002-3439-9860
  surname: Hansen
  fullname: Hansen, Mikkel
– sequence: 2
  givenname: Kim Guldstrand
  orcidid: 0000-0002-5953-3384
  surname: Larsen
  fullname: Larsen, Kim Guldstrand
– sequence: 3
  givenname: Radu
  surname: Mardare
  fullname: Mardare, Radu
– sequence: 4
  givenname: Mathias Ruggaard
  orcidid: 0000-0002-7470-4962
  surname: Pedersen
  fullname: Pedersen, Mathias Ruggaard
BookMark eNpNkEtLAzEUhYMoWGv_gKtZ6mI0N--4q8VHoSLYisuQTjI1pU0kmS767-1DxLs5l7P4DnwX6DSm6BG6AnxLqKDqbvI6mtbArtk96BuCQZ2gHiiBa64lO_33n6NBKUu8O0pBEdFD_N3bkmKIi2o4T5uuekib6EoVYvXpw-Kr866aZRtL6EKK1XRbOr8ul-istaviB7_ZRx9Pj7PRSz15ex6PhpO6oVh1tQCrmSReO9gNYsKEBS2pBycZ5W3TKtoIp6n0UnGpGis8KM2w4rR1YIH20fjIdckuzXcOa5u3JtlgDkXKC2NzF5qVN0qohhOFsW4tIyC1J1xQNxdyjonEYsciR1aTUynZt388wObg0ew9GmCGGdBm75H-AEk_ZOs
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.23638/LMCS-14(4:19)2018
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_868c528009fa42179e2563db67b02706
10_23638_LMCS_14_4_19_2018
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c308t-61a9472e9d10330246a1973e1d7435fcf83c6d937e78578ca6e18940853fd1a13
IEDL.DBID DOA
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000452745300011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:52:57 EDT 2025
Sat Nov 29 08:04:21 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c308t-61a9472e9d10330246a1973e1d7435fcf83c6d937e78578ca6e18940853fd1a13
ORCID 0000-0002-5953-3384
0000-0002-3439-9860
0000-0002-7470-4962
OpenAccessLink https://doaj.org/article/868c528009fa42179e2563db67b02706
ParticipantIDs doaj_primary_oai_doaj_org_article_868c528009fa42179e2563db67b02706
crossref_primary_10_23638_LMCS_14_4_19_2018
PublicationCentury 2000
PublicationDate 2018-01-01
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – month: 01
  year: 2018
  text: 2018-01-01
  day: 01
PublicationDecade 2010
PublicationTitle Logical methods in computer science
PublicationYear 2018
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.1236494
Snippet We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - formal languages and automata theory
computer science - logic in computer science
f.1.1
f.4.1
Title Reasoning About Bounds in Weighted Transition Systems
URI https://doaj.org/article/868c528009fa42179e2563db67b02706
Volume 14, Issue 4
WOSCitedRecordID wos000452745300011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV27TsMwFLVQxcDCG1Fe8sAAQlHr2E5sNlq1YmgrxLOb5fghdUlRGxj5dq6dFJWJhSVDFEXO8ePcc2Ofi9Al45YXOjeJt9IlTFiZ6IKlCQknfJhk3sTUxeson0zEdCof1kp9hT1htT1wDVxHZMLwFMIa6TWD-Fk6IGlqiywvQFHVZtvdXK6JqbgGUxoC5_qUTEphkHVG4_5TQtgVuyXyGmhP_GKiNcP-yCzDXbTdhIT4rm7KHtpw5T7aWZVbwM3sO0D80ellzJ7i8LOmwr1QEmmJZyV-iwlOZ3GknrgLCzde5IfoZTh47t8nTdWDxNCuqEDLacny1ElL4CuAQjNNZE4dsUD23BsvqMksRBUuFzDdjM4cETIYlVFviSb0CLXKeemOEeZh8XK8cIR5ZrJukRaEeFBc1lrivWyjmxUC6r02t1AgCiJeKuAFwkAxRaQKeLVRL4D082Qwpo43oLtU013qr-46-Y-XnKKt0KA6E3KGWtXiw52jTfNZzZaLizgS4Dr-GnwD27a06Q
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Reasoning+About+Bounds+in+Weighted+Transition+Systems&rft.jtitle=Logical+methods+in+computer+science&rft.au=Hansen%2C+Mikkel&rft.au=Larsen%2C+Kim+Guldstrand&rft.au=Mardare%2C+Radu&rft.au=Pedersen%2C+Mathias+Ruggaard&rft.date=2018-01-01&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=14%2C+Issue+4&rft_id=info:doi/10.23638%2FLMCS-14%284%3A19%292018&rft.externalDBID=n%2Fa&rft.externalDocID=10_23638_LMCS_14_4_19_2018
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon