Nested Weighted Automata

Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties...

Full description

Saved in:
Bibliographic Details
Published in:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 725 - 737
Main Authors: Chatterjee, Krishnendu, Henzinger, Thomas A., Otop, Jan
Format: Conference Proceeding
Language:English
Published: IEEE 01.07.2015
Subjects:
Automata
Complexity theory
Limit-average value functions
Model measuring
Monitoring
Nested Automata
Quantitative properties
Robustness
Semantics
Time factors
Weighted Automata
ISSN:1043-6871
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.
AbstractList Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.
Author Henzinger, Thomas A.
Otop, Jan
Chatterjee, Krishnendu
Author_xml – sequence: 1
  givenname: Krishnendu
  surname: Chatterjee
  fullname: Chatterjee, Krishnendu
  email: krish@ist.ac.at
  organization: IST, Austria
– sequence: 2
  givenname: Thomas A.
  surname: Henzinger
  fullname: Henzinger, Thomas A.
  email: tah@ist.ac.at
  organization: IST, Austria
– sequence: 3
  givenname: Jan
  surname: Otop
  fullname: Otop, Jan
  email: jotop@ist.ac.at
  organization: IST, Austria
BookMark eNotjLFOwzAQQI1UJNrSjQGJhR9IuDtffPZYRVAqRTAAYqwc-wJBtEVNGPh7QDC9t7w3M5PdfqfGnCGUiBCumnX9UBJgVQodmUUQjywheC8VT8wUgW3hvOCJmQ3DGwCQY5ia8zsdRs2Xz9q_vP7K8nPcb-MYT81xF98HXfxzbp5urh_r26K5X63rZVNEEh4LRAeJgVNuSQNxZ9myutZZzdRxoOAtCqBrq5SIEofYZlUrOTpBRDs3F3_fXlU3H4d-Gw9fG0H5aZ39BtFlOqc
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2015.72
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781479988754
1479988758
EndPage 737
ExternalDocumentID 7174926
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a274t-1160c404cdb2e924f3434e6b63ed2f49298317016b5cc22c49abdee37da671113
IEDL.DBID RIE
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380427100064&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 02:33:32 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a274t-1160c404cdb2e924f3434e6b63ed2f49298317016b5cc22c49abdee37da671113
PageCount 13
ParticipantIDs ieee_primary_7174926
PublicationCentury 2000
PublicationDate 20150701
PublicationDateYYYYMMDD 2015-07-01
PublicationDate_xml – month: 07
  year: 2015
  text: 20150701
  day: 01
PublicationDecade 2010
PublicationTitle 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0002179874
Score 2.0402317
Snippet Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and...
SourceID ieee
SourceType Publisher
StartPage 725
SubjectTerms Automata
Complexity theory
Limit-average value functions
Model measuring
Monitoring
Nested Automata
Quantitative properties
Robustness
Semantics
Time factors
Weighted Automata
Title Nested Weighted Automata
URI https://ieeexplore.ieee.org/document/7174926
WOSCitedRecordID wos000380427100064&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4A8eAJFQw-swePFsq229KjIRJNyIbEFzfSx2ziZTGw-Ptty7p68OKt6anTpv1mpt98A3CjDJOZ0ylx6Azh3FBirA4sQmm0UjxzkYz5Opd5Plku1aIFt00tDCJG8hkOwzD-5bu13YVU2ciHHkHfrg1tKcW-VqvJp6RBeSu4MvUr7IG-ViJgRPiooCG9q9H8cfoUSF3ZMOgC_2qqEjFl1v3fao6g_1Oclywa2DmGFpYn0P3uzpDUl7UHgzymMpO3mPz0g7tdtfb-qe7Dy-z-efpA6j4IRPuYsSLjsaCWU26dSdHHSwXjjKMwgqFLC78GNWFBVl2YzNo0tVxp4xCZdFrI0Er-FDrlusQBJIYWfs5YatCfg-bKGudRmwu0VFNbnEEvGLr62EtdrGobz_-evoDDsI179uoldKrNDq_gwH5W79vNdTyfLz41jU8
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VggRTgRaV7wyMuHVjJ6lHVFG1IkSVKNCt8sdFYklRSfn92G4IDCxsliefLfvdnd-9A7gRiiWRkSExaBThXFGitHQswkRJIXhkPBnzJU2ybLhYiFkDbutaGET05DPsuaH_yzcrvXGpsr4NPZy-3Q7sRpyHdFutVWdUQqe95ZyZ6h22UF9pETAS27igpr2LfjodPTlaV9RzysC_2qp4VBm3_reeQ-j8lOcFsxp4jqCBxTG0vvszBNV1bUM388nM4NWnP-3gblOurIcqO_A8vp-PJqTqhECkjRpLMhjEVHPKtVEh2ogpZ5xxjFXM0IS5XYMYMiesHqtI6zDUXEhlEFliZJy4ZvIn0CxWBXYhUDS3c0pThfYkJBdaGYvbPEZNJdX5KbSdocv3rdjFsrLx7O_pa9ifzB_TZTrNHs7hwG3plst6Ac1yvcFL2NOf5dvH-sqf1RfQQpCW
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%3Abook&rft.genre=proceeding&rft.title=2015+30th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Nested+Weighted+Automata&rft.au=Chatterjee%2C+Krishnendu&rft.au=Henzinger%2C+Thomas+A.&rft.au=Otop%2C+Jan&rft.date=2015-07-01&rft.pub=IEEE&rft.issn=1043-6871&rft.spage=725&rft.epage=737&rft_id=info:doi/10.1109%2FLICS.2015.72&rft.externalDocID=7174926
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon