A faster‐than relation for semi‐markov decision processes

When modeling concurrent or cyber-physical systems, non-functional requirements such as time are important to consider. In order to improve the timing aspects of a model, it is necessary to have some notion of what it means for a process to be faster than another, which can guide the stepwise refine...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic proceedings in theoretical computer science Ročník 312; číslo Proc. QAPL 2019; s. 29 - 42
Hlavní autoři: Ruggaard Pedersen, Mathias, Bacci, Giorgio, Guldstrand Larsen, Kim
Médium: Journal Article
Jazyk:angličtina
Vydáno: Open Publishing Association 20.01.2020
ISSN:2075-2180, 2075-2180
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 When modeling concurrent or cyber-physical systems, non-functional requirements such as time are important to consider. In order to improve the timing aspects of a model, it is necessary to have some notion of what it means for a process to be faster than another, which can guide the stepwise refinement of the model. To this end we study a faster-than relation for semi-Markov decision processes and compare it to standard notions for relating systems. We consider the compositional aspects of this relation, and show that the faster-than relation is not a precongruence with respect to parallel composition, hence giving rise to so-called parallel timing anomalies. We take the first steps toward understanding this problem by identifying decidable conditions sufficient to avoid parallel timing anomalies in the absence of non-determinism.
AbstractList When modeling concurrent or cyber-physical systems, non-functional requirements such as time are important to consider. In order to improve the timing aspects of a model, it is necessary to have some notion of what it means for a process to be faster than another, which can guide the stepwise refinement of the model. To this end we study a faster-than relation for semi-Markov decision processes and compare it to standard notions for relating systems. We consider the compositional aspects of this relation, and show that the faster-than relation is not a precongruence with respect to parallel composition, hence giving rise to so-called parallel timing anomalies. We take the first steps toward understanding this problem by identifying decidable conditions sufficient to avoid parallel timing anomalies in the absence of non-determinism.
Author Guldstrand Larsen, Kim
Bacci, Giorgio
Ruggaard Pedersen, Mathias
Author_xml – sequence: 1
  givenname: Mathias
  surname: Ruggaard Pedersen
  fullname: Ruggaard Pedersen, Mathias
  organization: Aalborg University
– sequence: 2
  givenname: Giorgio
  surname: Bacci
  fullname: Bacci, Giorgio
  organization: Aalborg University
– sequence: 3
  givenname: Kim
  surname: Guldstrand Larsen
  fullname: Guldstrand Larsen, Kim
  organization: Aalborg University
BookMark eNptUE1LAzEQDVLBWnvyD-xdtuZrd5ODh1JqLRQU7D1ksxNN3W5Ksgje_An-Rn-JaSsi4pvDDPPePIZ3jgad7wChS4InnGJ-PX9Yzx4njNAJO0FDiqsip0Tgwa_5DI1j3OAEJimX5RDdTDOrYw_h8_2jf9ZdFqDVvfNdZn3IImxdIrY6vPjXrAHj4p7aBW8gRogX6NTqNsL4u4_Q-na-nt3lq_vFcjZd5YZK2eecWM5EaWtOmWGMNKIyBTNNUwOutaiAl1IKISQpLasFEFmJShagseasoWyElkfbxuuN2gWXHnpTXjt1WPjwpHTonWlBybJIgBpTazmv91VRgcvCEltiIpPX1dHLBB9jAPvjR7Da56gOOaqUo2JJTf6ojesP-fRBu_bfmy-T0nha
CitedBy_id crossref_primary_10_1111_risa_13553
Cites_doi 10.1007/3-540-60246-1_150
10.1007/BFb0026571
10.1109/ISORC.2008.25
10.1016/j.tcs.2006.03.004
10.1017/CBO9780511569951
10.1061/9780784479926.036
10.1137/0117039
10.22028/D291-25951
10.1007/3-540-44685-0_18
10.1137/1.9781611973402.27
10.4230/OASIcs.WCET.2006.671
10.1016/S0169-7552(97)00133-5
10.1109/REAL.1999.818824
10.1007/BFb0013851
10.1006/inco.1995.1130
10.1109/LICS.1989.39190
10.4230/OASIcs.WCET.2012.1
10.1109/ECRTS.2009.8
10.1007/978-3-540-74407-8_28
10.1016/j.ic.2005.03.001
10.1145/1967701.1967707
10.2749/222137815818358204
10.1007/978-3-540-24611-4_1
10.1016/j.ipl.2014.08.013
10.1007/3-540-54430-5_104
10.1007/978-3-319-77313-1_21
10.1016/S0890-5401(03)00065-8
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.4204/EPTCS.312.3
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
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 2075-2180
EndPage 42
ExternalDocumentID oai_doaj_org_article_965555eb02ff44b4b4b728065f1f6019
10_4204_EPTCS_312_3
GroupedDBID 5VS
AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
E3Z
GROUPED_DOAJ
KQ8
M~E
OK1
ID FETCH-LOGICAL-c299t-41f4386fb423c331d87c53cddbe0ba87e4699888916f3b8e1978795ea0a43d23
IEDL.DBID DOA
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001045271100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2075-2180
IngestDate Fri Oct 03 12:35:30 EDT 2025
Sat Nov 29 02:05:30 EST 2025
Tue Nov 18 21:01:35 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue Proc. QAPL 2019
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c299t-41f4386fb423c331d87c53cddbe0ba87e4699888916f3b8e1978795ea0a43d23
OpenAccessLink https://doaj.org/article/965555eb02ff44b4b4b728065f1f6019
PageCount 14
ParticipantIDs doaj_primary_oai_doaj_org_article_965555eb02ff44b4b4b728065f1f6019
crossref_primary_10_4204_EPTCS_312_3
crossref_citationtrail_10_4204_EPTCS_312_3
PublicationCentury 2000
PublicationDate 2020-01-20
PublicationDateYYYYMMDD 2020-01-20
PublicationDate_xml – month: 01
  year: 2020
  text: 2020-01-20
  day: 20
PublicationDecade 2020
PublicationTitle Electronic proceedings in theoretical computer science
PublicationYear 2020
Publisher Open Publishing Association
Publisher_xml – name: Open Publishing Association
References Billingsley (billingsley1995) 1995
Hillston (hillston2005) 1996
Hermanns (hermanns1998) 1998; 30
Clarke (CLM89) 1989
Akshay (AAOW15) 2015; 115
Sokolova (SV04) 2004; 2925
Corradini (corradini1995) 1995; 969
Satoh (satoh1994) 1994; 907
Götz (gotz1993) 1993; 729
Vogler (vogler1995b) 1995; 121
Graham (graham1969) 1969; 17
Lundqvist (lundqvist1999) 1999
Kirner (kirner2009) 2009
Cassez (cassez2012) 2012; 23
Lee (lee2008) 2008
Lüttgen (LV01) 2001; 2154
Baier (BKHW05) 2005; 200
Ouaknine (OW14) 2014
Lüttgen (luttgen2006) 2006; 360
Reineke (reineke2006) 2006; 4
Pedersen (PFBLM18) 2018; 10792
Pulungan (pulungan2009) 2009
Thomas (TS16) 2016
Maovi (SSR15) 2015; 105
Neuhäußer (neuhausser2007) 2007; 4703
Tao (tao2013) 2013
Geilen (geilen2011) 2011
Vogler (vogler1995a) 2003; 184
Moller (MT91) 1991; 527
References_xml – volume: 969
  start-page: 444
  volume-title: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings
  year: 1995
  ident: corradini1995
  article-title: Performance Preorder: Ordering Processes with Respect to Speed
  doi: 10.1007/3-540-60246-1_150
– volume: 907
  start-page: 216
  volume-title: Theory and Practice of Parallel Programming, International Workshop TPPP'94, Sendai, Japan, November 7-9, 1994, Proceedings
  year: 1994
  ident: satoh1994
  article-title: A Formalism for Remotely Interacting Processes
  doi: 10.1007/BFb0026571
– start-page: 363
  volume-title: 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2008), 5-7 May 2008, Orlando, Florida, USA
  year: 2008
  ident: lee2008
  article-title: Cyber Physical Systems: Design Challenges
  doi: 10.1109/ISORC.2008.25
– volume: 360
  start-page: 209
  year: 2006
  ident: luttgen2006
  article-title: Bisimulation on speed: A unified approach
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2006.03.004
– volume-title: A compositional approach to performance modelling
  year: 1996
  ident: hillston2005
  doi: 10.1017/CBO9780511569951
– start-page: 384
  volume-title: International Conference on Transportation and Development
  year: 2016
  ident: TS16
  article-title: Semi-Markov Decision Process: A Decision Tool for Transportation Infrastructure Management Systems
  doi: 10.1061/9780784479926.036
– volume: 17
  start-page: 416
  issue: 2
  year: 1969
  ident: graham1969
  article-title: Bounds on Multiprocessing Timing Anomalies
  publication-title: SIAM Journal of Applied Mathematics
  doi: 10.1137/0117039
– volume-title: Reduction of Acyclic Phase-Type Representations
  year: 2009
  ident: pulungan2009
  doi: 10.22028/D291-25951
– volume: 2154
  start-page: 262
  volume-title: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings
  year: 2001
  ident: LV01
  article-title: A Faster-than Relation for Asynchronous Processes
  doi: 10.1007/3-540-44685-0_18
– start-page: 366
  volume-title: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014
  year: 2014
  ident: OW14
  article-title: Positivity Problems for Low-Order Linear Recurrence Sequences
  doi: 10.1137/1.9781611973402.27
– volume: 4
  volume-title: WCET
  year: 2006
  ident: reineke2006
  article-title: A Definition and Classification of Timing Anomalies
  doi: 10.4230/OASIcs.WCET.2006.671
– volume: 30
  start-page: 901
  year: 1998
  ident: hermanns1998
  article-title: Stochastic Process Algebras - Between LOTOS and Markov Chains
  publication-title: Computer Networks
  doi: 10.1016/S0169-7552(97)00133-5
– start-page: 12
  volume-title: Proceedings of the 20th IEEE Real-Time Systems Symposium, Phoenix, AZ, USA, December 1-3, 1999
  year: 1999
  ident: lundqvist1999
  article-title: Timing Anomalies in Dynamically Scheduled Microprocessors
  doi: 10.1109/REAL.1999.818824
– volume: 729
  start-page: 121
  volume-title: Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93, Santa Clara, CA, USA, May 10-14, 1993
  year: 1993
  ident: gotz1993
  article-title: Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras
  doi: 10.1007/BFb0013851
– volume: 121
  start-page: 149
  issue: 2
  year: 1995
  ident: vogler1995b
  article-title: Timed Testing of Concurrent Systems
  publication-title: Inf. Comput.
  doi: 10.1006/inco.1995.1130
– start-page: 353
  volume-title: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989
  year: 1989
  ident: CLM89
  article-title: Compositional Model Checking
  doi: 10.1109/LICS.1989.39190
– volume: 23
  start-page: 1
  volume-title: 12th International Workshop on Worst-Case Execution Time Analysis, WCET 2012, July 10, 2012, Pisa, Italy
  year: 2012
  ident: cassez2012
  article-title: What is a Timing Anomaly?
  doi: 10.4230/OASIcs.WCET.2012.1
– start-page: 119
  volume-title: 21st Euromicro Conference on Real-Time Systems, ECRTS 2009, Dublin, Ireland, July 1-3, 2009
  year: 2009
  ident: kirner2009
  article-title: Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
  doi: 10.1109/ECRTS.2009.8
– volume: 4703
  start-page: 412
  volume-title: CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings
  year: 2007
  ident: neuhausser2007
  article-title: Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
  doi: 10.1007/978-3-540-74407-8_28
– volume: 200
  start-page: 149
  issue: 2
  year: 2005
  ident: BKHW05
  article-title: Comparative branching-time semantics for Markov chains
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2005.03.001
– start-page: 23
  volume-title: Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011, Chicago, IL, USA, April 12-14, 2011
  year: 2011
  ident: geilen2011
  article-title: The earlier the better: a theory of timed actor interfaces
  doi: 10.1145/1967701.1967707
– volume: 105
  start-page: 1
  issue: 28
  year: 2015
  ident: SSR15
  article-title: Application of Semi-Markov Decision Process in Bridge Management
  publication-title: IABSE Symposium Report
  doi: 10.2749/222137815818358204
– volume-title: Probability And Measure
  year: 1995
  ident: billingsley1995
– volume-title: An Introduction to Measure Theory
  year: 2013
  ident: tao2013
– volume: 2925
  start-page: 1
  volume-title: Validation of Stochastic Systems - A Guide to Current Research
  year: 2004
  ident: SV04
  article-title: Probabilistic Automata: System Types, Parallel Composition and Comparison
  doi: 10.1007/978-3-540-24611-4_1
– volume: 115
  start-page: 155
  issue: 2
  year: 2015
  ident: AAOW15
  article-title: Reachability problems for Markov chains
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2014.08.013
– volume: 527
  start-page: 424
  volume-title: CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings
  year: 1991
  ident: MT91
  article-title: Relating Processes With Respect to Speed
  doi: 10.1007/3-540-54430-5_104
– volume: 10792
  start-page: 271
  volume-title: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings
  year: 2018
  ident: PFBLM18
  article-title: Timed Comparisons of Semi-Markov Processes
  doi: 10.1007/978-3-319-77313-1_21
– volume: 184
  start-page: 311
  issue: 2
  year: 2003
  ident: vogler1995a
  article-title: Faster asynchronous systems
  publication-title: Inf. Comput.
  doi: 10.1016/S0890-5401(03)00065-8
SSID ssj0000392496
Score 2.1427097
Snippet When modeling concurrent or cyber-physical systems, non-functional requirements such as time are important to consider. In order to improve the timing aspects...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 29
Title A faster‐than relation for semi‐markov decision processes
URI https://doaj.org/article/965555eb02ff44b4b4b728065f1f6019
Volume 312
WOSCitedRecordID wos001045271100003&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: 2075-2180
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0000392496
  issn: 2075-2180
  databaseCode: DOA
  dateStart: 20090101
  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: 2075-2180
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392496
  issn: 2075-2180
  databaseCode: M~E
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07a8MwEBYldOjSd2n6QkOmghrJkm15TNOELg2BeMgmbD1ooHVKkmbsb-9JdkIKhS61jQdzGPGd7LsP6e5DqEMTKaSwjETMGCJsxomMo4RwIBOxZQUvWRHEJtLRSE6n2XhH6svvCavbA9fAdbMkhsOWNHJOiNKfaVgNdMwBmQile5D17JCp8A_mnlcEZTmIiTAQSeviPBFR0R2M8_4E2Gr0wH-Eo52u_SG8DI_RYZMX4l49nhO0Z6tTdLTRXMDNJ3iGsh4eFr65Aclfiwpv9rJhyD3xxL7PiC--ma_xU6Odg5tKALs8R_lwkPefSSN_QDTEiBURzAkuE1dCxqM5Z0amOubamNLSspCpBWabAYGFBM_xUloGhDDNYlvQQnAT8QvUquaVvUQYrAVczkC0EkzHmWUiToWD-J04bVgb3W9AULppDe4VKt4UUASPmAqIKUBM8TbqbI0_6o4Yv5s9ejS3Jr6NdXgAzlWNc9Vfzr36j5dco4PIk2QKE5LeoNZq8Wlv0b5er2bLxV2YN3B_-Rp8AyoxwtM
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=A+Faster-Than+Relation+for+Semi-Markov+Decision+Processes&rft.jtitle=Electronic+proceedings+in+theoretical+computer+science&rft.au=Mathias+Ruggaard+Pedersen&rft.au=Giorgio+Bacci&rft.au=Kim+Guldstrand+Larsen&rft.date=2020-01-20&rft.pub=Open+Publishing+Association&rft.issn=2075-2180&rft.eissn=2075-2180&rft.volume=312&rft.issue=Proc.+QAPL+2019&rft.spage=29&rft.epage=42&rft_id=info:doi/10.4204%2FEPTCS.312.3&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_965555eb02ff44b4b4b728065f1f6019
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2075-2180&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2075-2180&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2075-2180&client=summon