Sampled Semantics of Timed Automata

Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Logical methods in computer science Ročník 6, Issue 3; číslo 3; s. 14:1
Hlavní autoři: Krcal, Pavel, Abdulla, Parosh Aziz, Yi, Wang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Logical Methods in Computer Science e.V 01.09.2010
Témata:
Applied mathematics
computer science - formal languages and automata theory
f.1.1, f.4.3
MATEMATIK
MATHEMATICS
Teoretisk datalogi
Theoretical computer science
Tillämpad matematik
ISSN:1860-5974, 1860-5974
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study one aspect of the relation between these two semantics, namely checking whether the system exhibits some qualitative (untimed) behaviors in the dense time which cannot be reproduced by any implementation with a fixed sampling rate. More formally, the \emph{sampling problem} is to decide whether there is a sampling rate such that all qualitative behaviors (the untimed language) accepted by a given timed automaton in dense time semantics can be also accepted in sampled semantics. We show that this problem is decidable.
AbstractList Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study one aspect of the relation between these two semantics, namely checking whether the system exhibits some qualitative (untimed) behaviors in the dense time which cannot be reproduced by any implementation with a fixed sampling rate. More formally, the \emph{sampling problem} is to decide whether there is a sampling rate such that all qualitative behaviors (the untimed language) accepted by a given timed automaton in dense time semantics can be also accepted in sampled semantics. We show that this problem is decidable.
Author Krcal, Pavel
Abdulla, Parosh Aziz
Yi, Wang
Author_xml – sequence: 1
  givenname: Pavel
  surname: Krcal
  fullname: Krcal, Pavel
– sequence: 2
  givenname: Parosh Aziz
  surname: Abdulla
  fullname: Abdulla, Parosh Aziz
– sequence: 3
  givenname: Wang
  surname: Yi
  fullname: Yi, Wang
BackLink https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-100547$$DView record from Swedish Publication Index (Uppsala universitet)
BookMark eNpVkM1Lw0AQxRepYK29eyx4UTA6s1_ZeCv1q1Dx0Op1mc3uSkrTlCRF_O9NWxGdywyPNz8e75T11tU6MHaOcMNRm9vZy2Se6Etxh_KKA8IR66PRkKgslb0_9wkbNs0SuhECDdd9djGncrMKfjQPJa3bIm9GVRwtirKTxtu2KqmlM3YcadWE4c8esLfHh8XkOZm9Pk0n41mSC4ltgjwaRcaQAc-9dzp1xkPISQnUwEFG54MwuSJECIoiSaeDcUhSAPhcDNj0wPUVLe2mLkqqv2xFhd0LVf1hqe4iroI1MUtTj9ERZdJrleUZRa4yRzwXSuuOdX1gNZ9hs3X_aPfF-3hP224tAiiZdnY42PO6apo6xN8HBLur2O4qttoKi9LuKhbfAntvcQ
Cites_doi 10.1109/LICS.2003.1210059
10.1109/CDC.1994.410933
10.1007/BFb0055642
10.1016/0022-0000(82)90051-4
10.1007/978-3-540-85361-9_9
10.1007/3-540-36580-X_28
10.1007/11603009_21
10.1051/ita/1994283-402771
10.1051/ita:2005027
10.1007/11590156_25
10.1016/0304-3975(90)90044-I
10.1109/LICS.2006.17
10.1007/978-3-540-28644-8_22
10.1016/0304-3975(94)90010-8
10.1007/3-540-55719-9_103
10.1007/3-540-45873-5_13
10.1007/978-3-540-24743-2_20
10.1007/978-3-540-87531-4_30
10.1007/978-3-540-70583-3_33
10.1016/0304-3975(91)90321-R
ContentType Journal Article
DBID AAYXX
CITATION
ADTPV
AOWAS
DF2
DOA
DOI 10.2168/LMCS-6(3:14)2010
DatabaseName CrossRef
SwePub
SwePub Articles
SWEPUB Uppsala universitet
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Mathematics
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_8f977d1fbaa94d659c9af259ba2c3566
oai_DiVA_org_uu_100547
10_2168_LMCS_6_3_14_2010
GroupedDBID 29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
M~E
OK1
OVT
P2P
TR2
TUS
XSB
.4S
.DC
ADMLS
ADTPV
AOWAS
ARCSS
DF2
MK~
ML~
ID FETCH-LOGICAL-c341t-12f85a88a80d2ddb67b8d0eca53160204fbde38c5a110e5afa4b6e8b1a4300dc3
IEDL.DBID DOA
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000282653500014&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:50:42 EDT 2025
Tue Nov 04 16:49:54 EST 2025
Sat Nov 29 08:14:40 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://arxiv.org/licenses/nonexclusive-distrib/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c341t-12f85a88a80d2ddb67b8d0eca53160204fbde38c5a110e5afa4b6e8b1a4300dc3
OpenAccessLink https://doaj.org/article/8f977d1fbaa94d659c9af259ba2c3566
ParticipantIDs doaj_primary_oai_doaj_org_article_8f977d1fbaa94d659c9af259ba2c3566
swepub_primary_oai_DiVA_org_uu_100547
crossref_primary_10_2168_LMCS_6_3_14_2010
PublicationCentury 2000
PublicationDate 2010-09-01
PublicationDateYYYYMMDD 2010-09-01
PublicationDate_xml – month: 09
  year: 2010
  text: 2010-09-01
  day: 01
PublicationDecade 2010
PublicationTitle Logical methods in computer science
PublicationYear 2010
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
References 10.2168/LMCS-6(3:14)2010_ICALP08:colcombet-loeding-mostowski
10.2168/LMCS-6(3:14)2010_GPV94
K. Hashiguchi (10.2168/LMCS-6(3:14)2010_hashiguchi82limitedness) 1982; 24
10.2168/LMCS-6(3:14)2010_henzinger92what
D. Kirsten (10.2168/LMCS-6(3:14)2010_kirsten05distance) 2005; 39
10.2168/LMCS-6(3:14)2010_amp98disc
10.2168/LMCS-6(3:14)2010_kp05on
10.2168/LMCS-6(3:14)2010_ow-lics03
10.2168/LMCS-6(3:14)2010_wdr04aasap
10.2168/LMCS-6(3:14)2010_ouaknine03universality
10.2168/LMCS-6(3:14)2010_aky08r-automata
10.2168/LMCS-6(3:14)2010_cassez02comparison
K. Hashiguchi (10.2168/LMCS-6(3:14)2010_hashiguchi90improved) 1990; 72
10.2168/LMCS-6(3:14)2010_kmty-concur04
10.2168/LMCS-6(3:14)2010_bc06bounds
R. Alur and D. L. Dill (10.2168/LMCS-6(3:14)2010_alur94theory) 1994; 126
H. Leung (10.2168/LMCS-6(3:14)2010_leung91limitedness) 1991; 81
I. Simon (10.2168/LMCS-6(3:14)2010_simon94semigroups) 1994; 28
10.2168/LMCS-6(3:14)2010_CSL08:colcombet-loeding-depth-mu-calculus
10.2168/LMCS-6(3:14)2010_altisen05implementation
References_xml – ident: 10.2168/LMCS-6(3:14)2010_ow-lics03
  doi: 10.1109/LICS.2003.1210059
– ident: 10.2168/LMCS-6(3:14)2010_GPV94
  doi: 10.1109/CDC.1994.410933
– ident: 10.2168/LMCS-6(3:14)2010_amp98disc
  doi: 10.1007/BFb0055642
– volume: 24
  start-page: 233
  issue: 2
  year: 1982
  ident: 10.2168/LMCS-6(3:14)2010_hashiguchi82limitedness
  publication-title: Computer and System Sciences
  doi: 10.1016/0022-0000(82)90051-4
– ident: 10.2168/LMCS-6(3:14)2010_aky08r-automata
  doi: 10.1007/978-3-540-85361-9_9
– ident: 10.2168/LMCS-6(3:14)2010_ouaknine03universality
  doi: 10.1007/3-540-36580-X_28
– ident: 10.2168/LMCS-6(3:14)2010_altisen05implementation
  doi: 10.1007/11603009_21
– volume: 28
  start-page: 277
  issue: 3-4
  year: 1994
  ident: 10.2168/LMCS-6(3:14)2010_simon94semigroups
  publication-title: Informatique Theorique et Applications
  doi: 10.1051/ita/1994283-402771
– volume: 39
  start-page: 455
  issue: 3
  year: 2005
  ident: 10.2168/LMCS-6(3:14)2010_kirsten05distance
  publication-title: Informatique Theorique et Applications
  doi: 10.1051/ita:2005027
– ident: 10.2168/LMCS-6(3:14)2010_kp05on
  doi: 10.1007/11590156_25
– volume: 72
  start-page: 27
  issue: 1
  year: 1990
  ident: 10.2168/LMCS-6(3:14)2010_hashiguchi90improved
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(90)90044-I
– ident: 10.2168/LMCS-6(3:14)2010_bc06bounds
  doi: 10.1109/LICS.2006.17
– ident: 10.2168/LMCS-6(3:14)2010_kmty-concur04
  doi: 10.1007/978-3-540-28644-8_22
– volume: 126
  start-page: 183
  issue: 2
  year: 1994
  ident: 10.2168/LMCS-6(3:14)2010_alur94theory
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(94)90010-8
– ident: 10.2168/LMCS-6(3:14)2010_henzinger92what
  doi: 10.1007/3-540-55719-9_103
– ident: 10.2168/LMCS-6(3:14)2010_cassez02comparison
  doi: 10.1007/3-540-45873-5_13
– ident: 10.2168/LMCS-6(3:14)2010_wdr04aasap
  doi: 10.1007/978-3-540-24743-2_20
– ident: 10.2168/LMCS-6(3:14)2010_CSL08:colcombet-loeding-depth-mu-calculus
  doi: 10.1007/978-3-540-87531-4_30
– ident: 10.2168/LMCS-6(3:14)2010_ICALP08:colcombet-loeding-mostowski
  doi: 10.1007/978-3-540-70583-3_33
– volume: 81
  start-page: 137
  issue: 1
  year: 1991
  ident: 10.2168/LMCS-6(3:14)2010_leung91limitedness
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(91)90321-R
SSID ssj0000331826
Score 1.8600448
Snippet Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware...
SourceID doaj
swepub
crossref
SourceType Open Website
Open Access Repository
Index Database
StartPage 14:1
SubjectTerms Applied mathematics
computer science - formal languages and automata theory
f.1.1, f.4.3
MATEMATIK
MATHEMATICS
Teoretisk datalogi
Theoretical computer science
Tillämpad matematik
Title Sampled Semantics of Timed Automata
URI https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-100547
https://doaj.org/article/8f977d1fbaa94d659c9af259ba2c3566
Volume 6, Issue 3
WOSCitedRecordID wos000282653500014&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: 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/eLvHCXMwrV3NS8MwFA8yPHjxW5xfFFRwh7KkadLE25wbHrYhTGW3kE_YwU221qN_u0nbyebFi5dCS0nb32ve-z1e3i8A3FgKEwO1jRPCVJz69Ctm2p9qZpCGxiGblY3Cg2w0YpMJf17b6iusCavkgSvg2sx5hmKQU1Ly1FDCNZfOc3YlE409FwneF2Z8LZkqfTDGgThXdckEUdYeDLvjmN7he5S2QgV4Iw6Vcv2_xELLANPfB7s1M4w61RsdgC07OwR7q10XonoSHoHrsQyKviYa23cPy1Qvo7mLQiuHiTpFPvcUVB6D137vpfsU11sdxNqHkTxGiWNEMiYZNIkximaKGWi19FOEhv5Vp4zFTBPpw7Ul0slUUcsUkimG0Gh8Ahqz-cyegoinxDtTpzJoghqYZNZyAxONkNNaZbwJWqsPFx-VooXwmUAASQSQBBXYJwQigNQEDwGZn_uCFnV5wVtI1BYSf1moCW4rXDeGeZy-dcphiiLoJpM0O_uPh52Dnaq-H1aBXYBGvijsJdjWn_l0ubgqfxJ_HH71vgH3u8LS
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=Sampled+semantics+of+timed+automata&rft.jtitle=Logical+methods+in+computer+science&rft.au=Abdulla%2C+Parosh+Aziz&rft.au=Krcal%2C+Pavel&rft.au=Yi%2C+Wang&rft.date=2010-09-01&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=6&rft.issue=3&rft.spage=14%3A1&rft_id=info:doi/10.2168%2FLMCS-6%283%3A14%292010&rft.externalDocID=oai_DiVA_org_uu_100547
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