Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wi...

Full description

Saved in:
Bibliographic Details
Published inACM computing surveys Vol. 55; no. 6; pp. 1 - 36
Main Authors Arcile, Johan, André, Étienne
Format Journal Article
LanguageEnglish
Published New York, NY ACM 31.07.2023
Association for Computing Machinery
Subjects
attack trees
Automata theory
Clocks
Computer Science
Cryptography and Security
cybersecurity
Formal security models
Formalism
Logic and verification
Logic in Computer Science
opacity
Security
Security and privacy
survey
Theory of computation
Timed and hybrid models
timed automata
Verification by model checking
survey
opacity
Timed automata
attack trees
cybersecurity
timed automata
Online AccessGet full text
ISSN0360-0300
1557-7341
DOI10.1145/3534967

Cover

Abstract Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties. In this work, we review works studying security properties for timed automata over the past two decades. We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions. We derive main conclusions concerning open perspectives, as well as tool support.
AbstractList Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties. In this work, we review works studying security properties for timed automata in the last two decades. We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions. We derive main conclusions concerning open perspectives, as well as tool support.
Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties. In this work, we review works studying security properties for timed automata over the past two decades. We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions. We derive main conclusions concerning open perspectives, as well as tool support.
ArticleNumber 127
Author Arcile, Johan
André, Étienne
Author_xml – sequence: 1
  givenname: Johan
  orcidid: 0000-0001-9979-3829
  surname: Arcile
  fullname: Arcile, Johan
  email: johan.arcile@univ-lorraine.fr
  organization: Université de Lorraine, CNRS, Inria, LORIA, Nancy, France
– sequence: 2
  givenname: Étienne
  orcidid: 0000-0001-8473-9555
  surname: André
  fullname: André, Étienne
  email: Andre.Etienne@lipn13.fr
  organization: Université de Lorraine, CNRS, Inria, LORIA, Nancy, France
BackLink https://hal.science/hal-03690234$$DView record in HAL
BookMark eNpt0E1Lw0AQBuBFKthW8e5pwYN4iO5nNvFWSmuFgkKr1zBNNnZLk627m2L-vS2tPYingZmHl5npoU5ta43QNSUPlAr5yCUXaazOUJdKqSLFBe2gLuExiQgn5AL1vF8RQpigcRd9zE2lCzxogq0gAAaPAY-tq2BtfIVL6_Doe-O096b-xDOdN86E9gkP8KxxW91iW-P5UlvXYqgL_OYgDybXl-i8hLXXV8faR-_j0Xw4iaavzy_DwTQCTuIQ6YVgRaJAFkpBkchUq0WqCkE4UJLqMhE5Z1IxntCYKpUUVGnJmSAJi_WiXPA-uj_kLmGdbZypwLWZBZNNBtNs39vdnRLGxZbu7O3Bbpz9arQP2co2rt6tl7GEcSoTofbq7qByZ713ujzFUpLtH5wdH7yT0R-ZmwDB2Do4MOt__M3BQ16dQn-HP6vIgt0
CitedBy_id crossref_primary_10_4204_EPTCS_392_1
crossref_primary_10_1145_3638043
crossref_primary_10_7717_peerj_cs_2377
crossref_primary_10_3390_app122412946
Cites_doi 10.1016/j.tcs.2015.07.048
10.1109/CCNC46108.2020.9045724
10.1109/HASE.2017.12
10.1109/QEST.2011.34
10.1016/j.ijcip.2012.08.002
10.1007/978-3-540-75454-1_15
10.1145/155848.155852
10.1007/978-3-319-08867-9_49
10.1007/s10207-008-0058-x
10.1515/amcs-2015-0031
10.1145/2896386
10.1016/0196-6774(82)90004-9
10.1007/978-3-319-39426-8_13
10.1109/ISCAS.2019.8702440
10.1145/1454630.1454638
10.1109/IAS.2008.10
10.1007/978-3-642-32122-1
10.1007/BFb0025774
10.1016/j.entcs.2004.11.044
10.1016/0020-0255(85)90026-X
10.1145/77648.77649
10.1007/978-3-030-57805-3_14
10.1007/978-3-030-01461-2_3
10.1007/978-3-319-46586-9_6
10.1145/167088.167242
10.1016/j.jnca.2012.05.003
10.1109/ICECCS.2019.00015
10.4230/LIPIcs.TIME.2017.21
10.1007/s00165-012-0269-9
10.1007/978-3-642-04081-8_33
10.1007/3-540-68697-5_9
10.1007/978-3-319-63121-9_1
10.1016/S0304-3975(01)00215-8
10.1016/S0065-2458(03)58003-2
10.1016/S0304-3975(02)00334-1
10.1145/234313.234418
10.1007/978-3-319-46586-9_5
10.1145/1029133.1029137
10.1016/0020-0190(95)00144-2
10.1109/SEFM.2003.1236205
10.1016/j.cosrev.2015.03.001
10.4304/jcp.4.5.366-377
10.3233/FI-2021-2066
10.1007/978-3-319-10512-3_2
10.1007/s11225-015-9637-9
10.17512/jamcm.2015.3.14
10.1145/7351.7352
10.1007/s10703-009-0074-0
10.1007/978-3-030-45190-5_24
10.1007/s10009-002-0094-1
10.1016/j.scico.2003.12.002
10.1145/2508859.2516712
10.1016/j.cosrev.2014.07.001
10.1109/TCAD.2018.2857363
10.1145/3214292.3214294
10.1109/MWC.2007.4396947
10.1016/0304-3975(94)90010-8
10.1007/s12927-019-0003-8
10.1051/ita:2000131
10.1109/ICECCS51672.2020.00012
10.1016/S0304-3975(01)00046-9
10.1007/978-3-030-81685-8_26
10.1109/CSF.2019.00010
10.1016/j.cose.2010.09.002
10.1109/CCNC.2018.8319187
10.1145/2518102
10.1109/TII.2011.2166794
10.1016/j.cag.2005.10.004
10.1006/inco.1993.1024
10.1145/1242572.1242656
10.1145/3078809
10.1145/3023872
10.1142/S021819401840020X
10.1145/3127586
10.1109/TKDE.2005.1
10.1007/978-3-319-89960-2_4
10.1109/TSE.2014.2359893
10.1007/978-3-030-20005-3_3
10.1007/978-3-642-30793-5_6
10.1093/logcom/exs029
10.1109/TSE.2017.2712621
10.1007/978-3-319-10506-2_22
10.1007/978-3-319-89363-1_4
10.1007/978-3-030-00151-3_3
10.1007/978-3-319-74860-3_5
10.1007/978-3-540-85735-8_6
10.1007/978-3-662-49635-0_9
10.1007/978-3-540-30080-9_1
10.1007/11539452_9
10.1016/S1567-8326(02)00037-1
10.1007/978-3-030-63406-3_1
10.5220/0010388701810188
10.1109/TSE.2010.4
10.1007/978-3-319-60840-2_35
10.1007/978-3-319-89722-6_2
10.1016/S0951-8320(01)00101-6
10.1007/978-3-030-75018-3_49
10.1007/978-3-030-29662-9_14
10.1145/3331524
10.1109/FUZZY.2010.5584893
10.1007/11560326_17
10.1613/jair.1.11936
10.1007/978-3-319-99981-4_3
10.1016/S1571-0661(04)00329-9
10.1016/j.entcs.2005.05.046
10.1007/11561163_8
10.1007/978-3-030-67220-1_3
10.1109/2.485845
10.5220/0007830605700577
10.1109/TIE.2005.855692
10.1145/501978.501979
10.1109/ISSRE.2011.19
10.1145/359657.359659
10.1007/978-3-662-46681-0_16
10.3233/FI-2009-0100
10.1023/A:1016598314198
10.1109/JSAC.2004.842547
10.17487/RFC6275
10.1109/IPDPS.2006.1639422
10.1007/978-3-030-79379-1_3
10.1007/978-3-319-94496-8_3
10.1109/49.1940
10.1002/sec.1401
10.3390/s21093055
10.1007/978-3-642-54862-8_21
10.1007/978-3-319-44878-7_3
10.4236/ijcns.2010.310104
10.1007/978-3-030-57628-8_4
10.1016/j.jisa.2021.102926
10.1007/978-3-642-29072-5_6
10.1007/0-387-24098-5_2
10.1145/3399742
10.1201/b13055-12
10.1109/SSIRI-C.2010.27
10.1007/978-3-319-70972-7_13
10.1007/3-540-60246-1_158
10.1145/360933.360975
10.1007/978-3-319-46598-2_10
10.1016/S1389-1286(01)00302-4
10.1109/DSC.2017.44
10.1007/s10009-017-0467-0
10.1007/s100090050010
10.1080/00207179.2014.944356
10.1145/1592451.1592452
10.25596/jalc-2001-003
10.3233/FI-2017-1527
10.1007/978-3-642-22110-1_30
10.1109/TSE.2006.104
10.1145/65000.65002
10.1109/40.977758
10.1007/978-3-642-02617-1_3
10.1007/s100090050009
10.1145/352600.352606
10.1109/TIT.1983.1056650
10.1007/978-3-319-48989-6_31
10.1145/964001.964017
10.1007/978-3-642-19751-2_6
10.1109/NESEA.2012.6474023
10.1109/CSFW.2000.856935
10.1016/S0304-3975(01)00330-9
10.1007/978-3-319-22975-1_11
10.1007/11513988_27
10.4230/LIPIcs.FSTTCS.2013.501
10.1007/BFb0055875
10.1016/j.microrel.2006.07.072
10.1109/RTCSA.1999.811256
10.1109/LICS.1996.561342
10.1145/182110.182113
10.1145/2808783.2808787
10.1016/j.cosrev.2013.05.001
10.1016/S0304-3975(97)00173-4
10.1007/s10009-014-0361-y
10.1007/s00450-014-0257-9
10.1016/j.pmcj.2015.06.007
10.1145/234313.234418
10.1145/3331524
10.1145/2508859.2516712
10.1145/360933.360975
10.5555/1370677.1370679
10.1145/2518102
10.1145/2808783.2808787
10.1145/167088.167242
10.5555/2370741.2370744
10.1145/352600.352606
10.1145/3127586
10.1145/3078809
10.1145/3502851
10.5555/2371116.2371118
10.1145/3214292.3214294
10.5555/2367396.2367405
10.1145/2896386
10.1145/3399742
10.1145/1029133.1029137
10.5555/2367396.2367411
10.1145/7351.7352
10.1145/182110.182113
10.1145/77648.77649
10.1016/B978-044450813-3/50026-6
10.1145/1592451.1592452
10.1145/1454630.1454638
10.1145/65000.65002
10.1145/359657.359659
10.1145/1242572.1242656
10.1145/501978.501979
10.1145/155848.155852
10.17512/jamcm.2016.2.13
10.1145/964001.964017
10.1145/3023872
ContentType Journal Article
Copyright Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from
Copyright Association for Computing Machinery Jun 2023
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from
– notice: Copyright Association for Computing Machinery Jun 2023
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
DOI 10.1145/3534967
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1557-7341
EndPage 36
ExternalDocumentID oai_HAL_hal_03690234v1
10_1145_3534967
3534967
GrantInformation_xml – fundername: ANR-NRF French-Singaporean research program ProMiS
  grantid: ANR-19-CE25-0015
GroupedDBID --Z
-DZ
-~X
.4S
.DC
23M
4.4
5GY
5VS
6J9
85S
8US
8VB
AAIKC
AAKMM
AALFJ
AAMNW
AAYFX
ABPPZ
ACGFO
ACGOD
ACM
ACNCT
ADBCU
ADL
ADMLS
ADPZR
AEBYY
AEGXH
AEMOZ
AENEX
AENSD
AFWIH
AFWXC
AGHSJ
AHQJS
AIAGR
AIKLT
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ARCSS
ASPBG
AVWKF
BDXCO
CCLIF
CS3
EBE
EBR
EBU
EDO
EMK
FEDTE
GUFHI
HGAVV
H~9
IAO
ICD
IEA
IGS
IOF
K1G
LHSKQ
N95
P1C
P2P
PQQKQ
QWB
RNS
ROL
RXW
TAE
TH9
U5U
UKR
UPT
VQA
W7O
WH7
X6Y
XH6
XSW
XZL
YXB
Z5M
ZCA
ZL0
AAYXX
AEFXT
AEJOY
AETEA
AKRVB
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
UMC
VOOES
ID FETCH-LOGICAL-a306t-eb42d87a5d77ad859e7b97d403a109ef84c3257238161778d17e53240826ebfb3
ISSN 0360-0300
IngestDate Fri May 09 12:28:33 EDT 2025
Mon Jun 30 13:19:54 EDT 2025
Thu Jul 03 08:35:07 EDT 2025
Thu Apr 24 23:00:41 EDT 2025
Fri Feb 21 01:12:16 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords survey
opacity
Timed automata
attack trees
cybersecurity
timed automata
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a306t-eb42d87a5d77ad859e7b97d403a109ef84c3257238161778d17e53240826ebfb3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-8473-9555
0000-0001-9979-3829
OpenAccessLink https://hal.science/hal-03690234
PQID 2823158471
PQPubID 47570
PageCount 36
ParticipantIDs hal_primary_oai_HAL_hal_03690234v1
proquest_journals_2823158471
crossref_primary_10_1145_3534967
crossref_citationtrail_10_1145_3534967
acm_primary_3534967
PublicationCentury 2000
PublicationDate 2023-07-31
PublicationDateYYYYMMDD 2023-07-31
PublicationDate_xml – month: 07
  year: 2023
  text: 2023-07-31
  day: 31
PublicationDecade 2020
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: Baltimore
PublicationTitle ACM computing surveys
PublicationTitleAbbrev ACM CSUR
PublicationYear 2023
Publisher ACM
Association for Computing Machinery
Publisher_xml – name: ACM
– name: Association for Computing Machinery
References (Bib0084) 2006
(Bib0082) 2017; 10744
(Bib0138) 2003; 5
(Bib0148) 2008; 5185
(Bib0141) 2006; 30
(Bib0154) 2001; 21
(Bib0091) 2005
(Bib0140) 2009; 5710
(Bib0029) 2002; 51
(Bib0125) 2018; 44
(Bib0177) 2018; 37
(Bib0051) 2005; 3653
(Bib0083) 2015; 30
(Bib0033) 2004; 3657
(Bib0109) 2015; 9268
(Bib0088) 2002; 52–53
(Bib0043) 2009; 35
(Bib0194) 2018
(Bib0172) 2018; 10804
(Bib0038) 2013; 24
(Bib0041) 2006; 32
(Bib0167) 2005
(Bib0035) 2015; 88
(Bib0129) 1996; 17
(Bib0077) 2004
(Bib0184) 2018; 10805
(Bib0062) 1975; 18
(Bib0107) 2014; 8666
(Bib0110) 2018; 10802
(Bib0181) 2019; 52
(Bib0130) 2018; 28
(Bib0103) 2010; 6561
(Bib0056) 2007; 15
(Bib0185) 2020; 12078
(Bib0080) 2007; 4763
(Bib0144) 2002; 8
(Bib0102) 2010
(Bib0171) 2017; 90
(Bib0046) 1990; 8
(Bib0188) 2017; 152
(Bib0089) 2014
(Bib0108) 2019
(Bib0174) 1981
(Bib0059) 2015; 17
(Bib0098) 2012; 7273
(Bib0149) 2015; 15
(Bib0092) 2020; 68
(Bib0189) 2002; 75
(Bib0153) 2005; 23
(Bib0005) 2010
(Bib0123) 2011
(Bib0086) 2016; 9635
(Bib0173) 2019
(Bib0024) 2014; 8711
(Bib0099) 2012; 5
(Bib0081) 1995
(Bib0030) 2003; 54
(Bib0139) 2017; 10460
(Bib0187) 2016; 104
(Bib0018) 2021; 12759
(Bib0008) 2002; 38
(Bib0169) 2008
(Bib0135) 2011; 30
(Bib0031) 2003; 292
(Bib0163) 2015; 14
(Bib0013) 1999; 211
(Bib0150) 2016; 9
(Bib0193) 2020
(Bib0143) 2001
(Bib0048) 1996; 28
(Bib0070) 2000
(Bib0121) 1995; 969
(Bib0170) 2020
(Bib0042) 2007
(Bib0057) 2010; 3
(Bib0021) 2018; 11022
(Bib0133) 2013; 36
(Bib0050) 2009; 5576
(Bib0093) 2016; 9871
(Bib0026) 2020; 12531
(Bib0087) 2009; 42
(Bib0115) 2012
(Bib0010) 2019
(Bib0044) 2008; 7
(Bib0168) 2012
(Bib0191) 2019; 951
(Bib0076) 2018; 10953
(Bib0118) 2003
(Bib0176) 2018; 11180
(Bib0078) 2005; 3685
(Bib0147) 2016; 255
(Bib0064) 1982; 3
(Bib0097) 2017; 50
(Bib0025) 2016; 59
(Bib0145) 2019
(Bib0160) 1985; 36
(Bib0054) 2004; 50
(Bib0065) 1983; 29
(Bib0152) 1996; 29
(Bib0192) 2017; 10314
(Bib0012) 1994; 126
(Bib0002) 2018; 65
(Bib0009) 2021; 415
(Bib0113) 2007; 79
(Bib0100) 2020; 63
(Bib0132) 2005; 52
(Bib0063) 2001; 6
(Bib0096) 2007; 14
(Bib0019) 2020
(Bib0011) 1993; 104
(Bib0022) 2021; 182
(Bib0136) 1978; 21
(Bib0073) 2016; 9884
(Bib0190) 1997; 1
(Bib0003) 2016; 612
(Bib0049) 2006; 46
(Bib0023) 2021; 12740
(Bib0085) 1996
(Bib0020) 2022
(Bib0036) 2009; 4
(Bib0157) 2020; 1267
(Bib0040) 2017; 50
(Bib0037) 2001; 4
(Bib0111) 2017
(Bib0061) 2018
(Bib0071) 2014; 46
(Bib0161) 2015; 24
(Bib0182) 2019; 11750
(Bib0151) 1988; 6
(Bib0060) 2015
(Bib0165) 2019; 852
(Bib0104) 2014; 24
(Bib0079) 2006
(Bib0017) 2019; 21
(Bib0156) 2017; 10322
(Bib0164) 2016; 522
(Bib0131) 2004
Bib0001
(Bib0055) 2004
(Bib0112) 2016; 522
(Bib0095) 2008; 85
(Bib0072) 2011; 6806
(Bib0039) 2003; 58
(Bib0158) 2016; 15
(Bib0004) 2003; 290
(Bib0027) 2005; 3576
(Bib0032) 2005; 128
(Bib0155) 1989; 7
(Bib0142) 2011; 6275
(Bib0045) 2012; 5
(Bib0128) 1995; 56
(Bib0186) 1994; 28
(Bib0116) 2002; 282
(Bib0075) 2012
(Bib0127) 2020; 12524
(Bib0090) 2007; 79
(Bib0105) 2014; 13–14
(Bib0180) 2015; 41
(Bib0066) 2014; 8559
(Bib0137) 1993; 27
(Bib0014) 1993
(Bib0175) 2013; 9
(Bib0068) 2000
(Bib0122) 1997; 1
(Bib0101) 1996; 1109
(Bib0106) 2013
(Bib0159) 2019; 11
(Bib0058) 2015; 9035
(Bib0094) 2005; 17
(Bib0028) 2014; 26
(Bib0034) 1998; 1485
(Bib0069) 2001; 62
(Bib0183) 2020; 12288
(Bib0006) 2003; 300
(Bib0146) 2015; 25
(Bib0162) 2021
(Bib0126) 2011
(Bib0016) 2021; 61
(Bib0007) 2000; 34
(Bib0134) 2008
(Bib0178) 2017
(Bib0053) 2001
(Bib0067) 1999
(Bib0047) 2011; 7
(Bib0166) 2021; 21
(Bib0179) 2014; 8413
(Bib0015) 2004; 3185
(Bib0114) 2009; 93
(Bib0117) 1987; 5
(Bib0074) 2007; 180
(Bib0119) 2005; 173
(Bib0120) 2010; 36
(Bib0124) 2016; 9995
(Bib0052) 1981; 131
e_1_3_2_195_2
e_1_3_2_172_2
e_1_3_2_62_2
e_1_3_2_85_2
e_1_3_2_24_2
e_1_3_2_47_2
e_1_3_2_100_2
e_1_3_2_123_2
e_1_3_2_146_2
e_1_3_2_169_2
e_1_3_2_108_2
e_1_3_2_7_2
e_1_3_2_161_2
e_1_3_2_184_2
e_1_3_2_73_2
e_1_3_2_12_2
e_1_3_2_58_2
e_1_3_2_35_2
e_1_3_2_112_2
e_1_3_2_135_2
e_1_3_2_158_2
e_1_3_2_50_2
e_1_3_2_48_2
Jakubowska Gizela (e_1_3_2_92_2) 2005
e_1_3_2_40_2
e_1_3_2_86_2
e_1_3_2_171_2
e_1_3_2_63_2
e_1_3_2_25_2
e_1_3_2_145_2
e_1_3_2_168_2
e_1_3_2_122_2
e_1_3_2_107_2
e_1_3_2_59_2
e_1_3_2_6_2
e_1_3_2_183_2
e_1_3_2_51_2
e_1_3_2_74_2
e_1_3_2_160_2
e_1_3_2_13_2
e_1_3_2_36_2
e_1_3_2_97_2
Lowe Gavin (e_1_3_2_130_2) 1996; 17
e_1_3_2_134_2
e_1_3_2_157_2
e_1_3_2_111_2
e_1_3_2_119_2
e_1_3_2_151_2
e_1_3_2_22_2
e_1_3_2_45_2
e_1_3_2_68_2
e_1_3_2_125_2
e_1_3_2_148_2
e_1_3_2_60_2
e_1_3_2_83_2
e_1_3_2_102_2
e_1_3_2_163_2
e_1_3_2_186_2
e_1_3_2_18_2
e_1_3_2_140_2
e_1_3_2_10_2
e_1_3_2_5_2
e_1_3_2_33_2
e_1_3_2_79_2
e_1_3_2_56_2
e_1_3_2_114_2
e_1_3_2_137_2
e_1_3_2_94_2
e_1_3_2_71_2
e_1_3_2_152_2
Mazaré Laurent (e_1_3_2_132_2) 2004
e_1_3_2_150_2
e_1_3_2_173_2
e_1_3_2_84_2
e_1_3_2_23_2
e_1_3_2_69_2
e_1_3_2_46_2
e_1_3_2_124_2
e_1_3_2_147_2
e_1_3_2_61_2
e_1_3_2_101_2
e_1_3_2_185_2
e_1_3_2_109_2
e_1_3_2_19_2
Godskesen Jens Chr (e_1_3_2_80_2) 2006
e_1_3_2_162_2
e_1_3_2_11_2
e_1_3_2_34_2
e_1_3_2_57_2
e_1_3_2_95_2
e_1_3_2_4_2
e_1_3_2_113_2
e_1_3_2_159_2
e_1_3_2_136_2
e_1_3_2_72_2
e_1_3_2_174_2
Gregersen H. (e_1_3_2_82_2) 1995
e_1_3_2_28_2
e_1_3_2_191_2
e_1_3_2_20_2
e_1_3_2_43_2
Kacprzak Magdalena (e_1_3_2_96_2) 2008; 85
e_1_3_2_66_2
e_1_3_2_89_2
e_1_3_2_104_2
e_1_3_2_142_2
e_1_3_2_165_2
e_1_3_2_188_2
e_1_3_2_81_2
e_1_3_2_127_2
e_1_3_2_16_2
e_1_3_2_39_2
e_1_3_2_54_2
e_1_3_2_31_2
e_1_3_2_180_2
e_1_3_2_3_2
e_1_3_2_77_2
e_1_3_2_131_2
e_1_3_2_154_2
e_1_3_2_177_2
e_1_3_2_116_2
e_1_3_2_139_2
Zbrzezny Agnieszka M. (e_1_3_2_194_2) 2020
Vesely William E. (e_1_3_2_175_2) 1981
e_1_3_2_190_2
e_1_3_2_29_2
Hyla Tomasz (e_1_3_2_90_2) 2014
e_1_3_2_21_2
e_1_3_2_44_2
e_1_3_2_67_2
e_1_3_2_126_2
e_1_3_2_103_2
e_1_3_2_141_2
e_1_3_2_187_2
e_1_3_2_164_2
e_1_3_2_149_2
e_1_3_2_17_2
e_1_3_2_32_2
e_1_3_2_55_2
e_1_3_2_78_2
e_1_3_2_2_2
e_1_3_2_93_2
e_1_3_2_115_2
Perrig Adrian (e_1_3_2_144_2) 2001
e_1_3_2_176_2
e_1_3_2_70_2
e_1_3_2_153_2
e_1_3_2_138_2
e_1_3_2_26_2
e_1_3_2_49_2
e_1_3_2_193_2
e_1_3_2_41_2
e_1_3_2_64_2
e_1_3_2_87_2
e_1_3_2_170_2
e_1_3_2_167_2
e_1_3_2_121_2
e_1_3_2_106_2
e_1_3_2_129_2
e_1_3_2_9_2
e_1_3_2_37_2
e_1_3_2_75_2
e_1_3_2_182_2
e_1_3_2_52_2
e_1_3_2_14_2
e_1_3_2_98_2
e_1_3_2_156_2
e_1_3_2_179_2
e_1_3_2_110_2
e_1_3_2_133_2
e_1_3_2_118_2
e_1_3_2_27_2
e_1_3_2_192_2
e_1_3_2_65_2
e_1_3_2_42_2
e_1_3_2_88_2
e_1_3_2_189_2
e_1_3_2_120_2
e_1_3_2_166_2
e_1_3_2_143_2
e_1_3_2_105_2
e_1_3_2_128_2
e_1_3_2_15_2
e_1_3_2_38_2
e_1_3_2_8_2
e_1_3_2_30_2
e_1_3_2_53_2
e_1_3_2_76_2
e_1_3_2_99_2
e_1_3_2_181_2
e_1_3_2_91_2
e_1_3_2_178_2
e_1_3_2_155_2
e_1_3_2_117_2
References_xml – volume: 612
  start-page: 1
  year: 2016
  end-page: 22
  ident: Bib0003
  article-title: Parameterized verification of time-sensitive models of ad hoc network protocols
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2015.07.048
– start-page: 1
  year: 2020
  end-page: 9
  ident: Bib0170
  article-title: Attack trees for security and privacy in social virtual reality learning environments
  publication-title: CCNC
  doi: 10.1109/CCNC46108.2020.9045724
– start-page: 25
  year: 2017
  end-page: 32
  ident: Bib0111
  article-title: Quantitative security and safety analysis with attack-fault trees
  publication-title: HASE
  doi: 10.1109/HASE.2017.12
– year: 2014
  ident: Bib0089
  article-title: Sensitive information protection on mobile devices using general access structures
  publication-title: ICONS
– start-page: 191
  year: 2011
  end-page: 200
  ident: Bib0123
  article-title: Model-based security metrics using ADversary view security evaluation (ADVISE)
  publication-title: QEST
  doi: 10.1109/QEST.2011.34
– volume: 5
  start-page: 118
  issue: 3–4
  year: 2012
  end-page: 126
  ident: Bib0045
  article-title: Modeling security in cyber-physical systems
  publication-title: Int. J. Crit. Infrastruct. Protect.
  doi: 10.1016/j.ijcip.2012.08.002
– volume: 4763
  start-page: 195
  year: 2007
  end-page: 210
  ident: Bib0080
  article-title: Efficient detection of zeno runs in timed automata
  publication-title: FORMATS
  doi: 10.1007/978-3-540-75454-1_15
– volume: 27
  start-page: 10
  issue: 2
  year: 1993
  end-page: 14
  ident: Bib0137
  article-title: A note on the use of timestamps as nonces
  publication-title: ACM SIGOPS Operat. Syst. Rev.
  doi: 10.1145/155848.155852
– volume: 8559
  start-page: 737
  year: 2014
  end-page: 744
  ident: Bib0066
  article-title: Yices 2.2
  publication-title: CAV
  doi: 10.1007/978-3-319-08867-9_49
– volume: 7
  start-page: 421
  issue: 6
  year: 2008
  end-page: 435
  ident: Bib0044
  article-title: Opacity generalised to transition systems
  publication-title: Int. J. Inf. Secur.
  doi: 10.1007/s10207-008-0058-x
– volume: 25
  start-page: 403
  issue: 2
  year: 2015
  end-page: 414
  ident: Bib0146
  article-title: Probability timed automata for investigating communication processes
  publication-title: Int. J. Appl. Math. Comput. Sci.
  doi: 10.1515/amcs-2015-0031
– volume: 59
  start-page: 76
  issue: 4
  year: 2016
  end-page: 84
  ident: Bib0025
  article-title: Secure multiparty computations on bitcoin
  publication-title: Commun. ACM
  doi: 10.1145/2896386
– volume: 3
  start-page: 14
  issue: 1
  year: 1982
  end-page: 30
  ident: Bib0064
  article-title: The byzantine generals strike again
  publication-title: J. Algor.
  doi: 10.1016/0196-6774(82)90004-9
– volume: 255
  start-page: 158
  year: 2016
  end-page: 168
  ident: Bib0147
  article-title: Parallel real time investigation of communication security changes based on probabilistic timed automata
  publication-title: BIS
  doi: 10.1007/978-3-319-39426-8_13
– year: 2001
  ident: Bib0143
  article-title: Efficient and secure source authentication for multicast
  publication-title: NDSS
– start-page: 1
  year: 2019
  end-page: 5
  ident: Bib0010
  article-title: Towards system level security analysis of artificial pancreas via UPPAAL-SMC
  publication-title: ISCAS
  doi: 10.1109/ISCAS.2019.8702440
– start-page: 100
  year: 2005
  end-page: 115
  ident: Bib0091
  article-title: Verifying security protocols with timestamps via translation to timed automata
  publication-title: CS&P
– start-page: 51
  year: 2008
  end-page: 58
  ident: Bib0169
  article-title: Modelling secure wireless sensor networks routing protocols with timed automata
  publication-title: PM2HW2N
  doi: 10.1145/1454630.1454638
– year: 2001
  ident: Bib0053
  publication-title: Model Checking
– start-page: 37
  year: 2008
  end-page: 40
  ident: Bib0134
  article-title: Security analysis of temporal-RBAC using timed automata
  publication-title: IAS
  doi: 10.1109/IAS.2008.10
– year: 2012
  ident: Bib0168
  publication-title: Software Testing in the Cloud—Migration and Execution
  doi: 10.1007/978-3-642-32122-1
– volume: 131
  start-page: 52
  year: 1981
  end-page: 71
  ident: Bib0052
  article-title: Design and synthesis of synchronization skeletons using branching-time temporal logic
  publication-title: Proceedings of the Workshop on Logics of Programs
  doi: 10.1007/BFb0025774
– volume: 128
  start-page: 105
  issue: 5
  year: 2005
  end-page: 119
  ident: Bib0032
  article-title: Team automata for security: A survey
  publication-title: Electr. Not. Theor. Comput. Sci.
  doi: 10.1016/j.entcs.2004.11.044
– volume: 79
  start-page: 363
  issue: 3–4
  year: 2007
  end-page: 378
  ident: Bib0090
  article-title: Modelling and checking timed authentication of security protocols
  publication-title: Fundam. Inf.
– volume: 36
  start-page: 59
  issue: 1–2
  year: 1985
  end-page: 83
  ident: Bib0160
  article-title: An introductory survey of fuzzy control
  publication-title: Inf. Sci.
  doi: 10.1016/0020-0255(85)90026-X
– volume: 8
  start-page: 18
  issue: 1
  year: 1990
  end-page: 36
  ident: Bib0046
  article-title: A logic of authentication
  publication-title: ACM Trans. Comput. Syst.
  doi: 10.1145/77648.77649
– volume: 1267
  start-page: 142
  year: 2020
  end-page: 151
  ident: Bib0157
  article-title: Probabilistic and timed analysis of security protocols
  publication-title: CISIS
  doi: 10.1007/978-3-030-57805-3_14
– volume: 11180
  start-page: 44
  year: 2018
  end-page: 60
  ident: Bib0176
  article-title: Decidability of the initial-state opacity of real-time automata
  publication-title: Symposium on Real-Time and Hybrid Systems—Essays Dedicated to Professor Chaochen Zhou on the Occasion of His 80th Birthday
  doi: 10.1007/978-3-030-01461-2_3
– volume: 15
  issue: 2
  year: 2016
  ident: Bib0158
  article-title: Using probabilistic automata for security protocols verification
  publication-title: J. Appl. Math. Comput. Mech.
– volume: 522
  start-page: 65
  year: 2016
  end-page: 75
  ident: Bib0112
  article-title: Some remarks on security protocols verification tools
  publication-title: ISAT, Part II
  doi: 10.1007/978-3-319-46586-9_6
– year: 1981
  ident: Bib0174
  publication-title: Fault Tree Handbook
– start-page: 592
  year: 1993
  end-page: 601
  ident: Bib0014
  article-title: Parametric real-time reasoning
  publication-title: STOC
  doi: 10.1145/167088.167242
– volume: 36
  start-page: 42
  issue: 1
  year: 2013
  end-page: 57
  ident: Bib0133
  article-title: A survey of intrusion detection techniques in cloud
  publication-title: J. Netw. Comput. Appl.
  doi: 10.1016/j.jnca.2012.05.003
– start-page: 71
  year: 2019
  end-page: 80
  ident: Bib0145
  article-title: Squeezing state spaces of (attack-defence) trees
  publication-title: ICECCS
  doi: 10.1109/ICECCS.2019.00015
– volume: 90
  start-page: 21:1–21:18
  year: 2017
  ident: Bib0171
  article-title: Time dependent policy-based access control
  publication-title: TIME
  doi: 10.4230/LIPIcs.TIME.2017.21
– volume: 26
  start-page: 99
  issue: 1
  year: 2014
  end-page: 123
  ident: Bib0028
  article-title: Formal verification of security protocol implementations: A survey
  publication-title: Form. Aspects Comput.
  doi: 10.1007/s00165-012-0269-9
– volume: 5710
  start-page: 496
  year: 2009
  end-page: 510
  ident: Bib0140
  article-title: Time-bounded verification
  publication-title: CONCUR
  doi: 10.1007/978-3-642-04081-8_33
– volume: 1109
  start-page: 104
  year: 1996
  end-page: 113
  ident: Bib0101
  article-title: Timing attacks on implementations of diffie-hellman, RSA, DSS, and other systems
  publication-title: CRYPTO
  doi: 10.1007/3-540-68697-5_9
– volume: 10460
  start-page: 3
  year: 2017
  end-page: 21
  ident: Bib0139
  article-title: Information flow for timed automata
  publication-title: Models, Algorithms, Logics and Tools
  doi: 10.1007/978-3-319-63121-9_1
– volume: 292
  start-page: 65
  issue: 1
  year: 2003
  end-page: 84
  ident: Bib0031
  article-title: On probabilistic timed automata
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00215-8
– volume: 58
  start-page: 117
  year: 2003
  end-page: 148
  ident: Bib0039
  article-title: Bounded model checking
  publication-title: Adv. Comput.
  doi: 10.1016/S0065-2458(03)58003-2
– volume: 300
  start-page: 411
  issue: 1-3
  year: 2003
  end-page: 475
  ident: Bib0006
  article-title: The power of reachability testing for timed automata
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(02)00334-1
– volume: 28
  start-page: 263
  issue: 1
  year: 1996
  end-page: 264
  ident: Bib0048
  article-title: Type systems
  publication-title: Comput. Surv.
  doi: 10.1145/234313.234418
– volume: 522
  start-page: 53
  year: 2016
  end-page: 63
  ident: Bib0164
  article-title: Timed analysis of security protocols
  publication-title: ISAT, Part II
  doi: 10.1007/978-3-319-46586-9_5
– start-page: 23
  year: 2004
  end-page: 32
  ident: Bib0055
  article-title: Timed model checking of security protocols
  publication-title: FMSE
  doi: 10.1145/1029133.1029137
– volume: 56
  start-page: 131
  issue: 3
  year: 1995
  end-page: 133
  ident: Bib0128
  article-title: An attack on the needham-schroeder public-key authentication protocol
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(95)00144-2
– start-page: 34
  year: 2003
  end-page: 43
  ident: Bib0118
  article-title: Weak bisimulation for probabilistic timed automata and applications to security
  publication-title: SEFM
  doi: 10.1109/SEFM.2003.1236205
– volume: 15
  start-page: 29
  year: 2015
  end-page: 62
  ident: Bib0149
  article-title: Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools
  publication-title: Comput. Sci. Rev.
  doi: 10.1016/j.cosrev.2015.03.001
– volume: 51
  start-page: 1
  issue: 1–2
  year: 2002
  end-page: 11
  ident: Bib0029
  article-title: A notion of non-interference for timed automata
  publication-title: Fundam. Inf.
– volume: 4
  start-page: 366
  issue: 5
  year: 2009
  end-page: 377
  ident: Bib0036
  article-title: TPMC: A model checker for time-sensitive security protocols
  publication-title: J. Comput.
  doi: 10.4304/jcp.4.5.366-377
– volume: 182
  start-page: 69
  issue: 1
  year: 2021
  end-page: 94
  ident: Bib0022
  article-title: Parametric analyses of attack-fault trees
  publication-title: Fundam. Inf.
  doi: 10.3233/FI-2021-2066
– start-page: 2123
  year: 2020
  end-page: 2125
  ident: Bib0193
  article-title: VerSecTis—An agent based model checker for security protocols
  publication-title: AAMAS
– volume: 8711
  start-page: 7
  year: 2014
  end-page: 22
  ident: Bib0024
  article-title: Modeling bitcoin contracts by timed automata
  publication-title: FORMATS
  doi: 10.1007/978-3-319-10512-3_2
– volume: 104
  start-page: 641
  issue: 4
  year: 2016
  end-page: 678
  ident: Bib0187
  article-title: Checking EMTLK properties of timed interpreted systems via bounded model checking
  publication-title: Stud. Logic.
  doi: 10.1007/s11225-015-9637-9
– volume: 14
  start-page: 127
  issue: 3
  year: 2015
  end-page: 139
  ident: Bib0163
  article-title: Timed models of security protocols including delays in the network
  publication-title: J. Appl. Math. Comput. Mech.
  doi: 10.17512/jamcm.2015.3.14
– volume: 5
  start-page: 1
  issue: 1
  year: 1987
  end-page: 11
  ident: Bib0117
  article-title: A fast mutual exclusion algorithm
  publication-title: ACM Trans. Comput. Syst.
  doi: 10.1145/7351.7352
– volume: 35
  start-page: 121
  issue: 2
  year: 2009
  end-page: 151
  ident: Bib0043
  article-title: Decision problems for lower/upper bound parametric timed automata
  publication-title: Form. Methods Syst. Des.
  doi: 10.1007/s10703-009-0074-0
– volume: 12078
  start-page: 425
  year: 2020
  end-page: 443
  ident: Bib0185
  article-title: Verified certification of reachability checking for timed automata
  publication-title: TACAS, Part I
  doi: 10.1007/978-3-030-45190-5_24
– volume: 5
  start-page: 59
  issue: 1
  year: 2003
  end-page: 77
  ident: Bib0138
  article-title: Automated test generation from timed automata
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s10009-002-0094-1
– volume: 50
  start-page: 51
  issue: 1-3
  year: 2004
  end-page: 71
  ident: Bib0054
  article-title: Security properties: Two agents are sufficient
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2003.12.002
– start-page: 1055
  year: 2013
  end-page: 1062
  ident: Bib0106
  article-title: Cross-origin pixel stealing: Timing attacks using CSS filters
  publication-title: CCS
  doi: 10.1145/2508859.2516712
– volume: 13–14
  start-page: 1
  year: 2014
  end-page: 38
  ident: Bib0105
  article-title: DAG-based attack and defense modeling: Don’t miss the forest for the attack trees
  publication-title: Comput. Sci. Rev.
  doi: 10.1016/j.cosrev.2014.07.001
– volume: 37
  start-page: 2845
  issue: 11
  year: 2018
  end-page: 2856
  ident: Bib0177
  article-title: The opacity of real-time automata
  publication-title: IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst.
  doi: 10.1109/TCAD.2018.2857363
– start-page: 2:1–2:8
  year: 2018
  ident: Bib0061
  article-title: Cache timing side-channel vulnerability checking with computation tree logic
  publication-title: ISCA
  doi: 10.1145/3214292.3214294
– volume: 14
  start-page: 85
  issue: 5
  year: 2007
  end-page: 91
  ident: Bib0096
  article-title: A survey of routing attacks in mobile ad hoc networks
  publication-title: IEEE Wireless Commun.
  doi: 10.1109/MWC.2007.4396947
– volume: 126
  start-page: 183
  issue: 2
  year: 1994
  end-page: 235
  ident: Bib0012
  article-title: A theory of timed automata
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)90010-8
– volume: 11
  start-page: 47
  issue: 1
  year: 2019
  end-page: 67
  ident: Bib0159
  article-title: A state-of-the-art survey on formal verification of the internet of things applications
  publication-title: J. Serv. Sci. Res.
  doi: 10.1007/s12927-019-0003-8
– volume: 34
  start-page: 565
  issue: 6
  year: 2000
  end-page: 584
  ident: Bib0007
  article-title: Characteristic formulae for timed automata
  publication-title: RAIRO Theor. Inf. Appl.
  doi: 10.1051/ita:2000131
– start-page: 37
  year: 2020
  end-page: 42
  ident: Bib0019
  article-title: Parametric non-interference in timed automata
  publication-title: ICECCS
  doi: 10.1109/ICECCS51672.2020.00012
– volume: 282
  start-page: 101
  issue: 1
  year: 2002
  end-page: 150
  ident: Bib0116
  article-title: Automatic verification of real-time systems with discrete probability distributions
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00046-9
– volume: 12759
  start-page: 1
  year: 2021
  end-page: 14
  ident: Bib0018
  article-title: IMITATOR 3: Synthesis of timing parameters beyond decidability
  publication-title: CAV
  doi: 10.1007/978-3-030-81685-8_26
– start-page: 32
  year: 2019
  end-page: 47
  ident: Bib0173
  article-title: Timing leaks and coarse-grained clocks
  publication-title: CSF
  doi: 10.1109/CSF.2019.00010
– volume: 30
  start-page: 128
  issue: 2–3
  year: 2011
  end-page: 147
  ident: Bib0135
  article-title: Security analysis of GTRBAC and its variants using model checking
  publication-title: Comput. Secur.
  doi: 10.1016/j.cose.2010.09.002
– start-page: 1
  year: 2018
  end-page: 4
  ident: Bib0194
  article-title: Towards a social virtual reality learning environment in high fidelity
  publication-title: CCNC
  doi: 10.1109/CCNC.2018.8319187
– volume: 46
  start-page: 40:1–40:56
  issue: 3
  year: 2014
  ident: Bib0071
  article-title: A menagerie of timed automata
  publication-title: Comput. Surv.
  doi: 10.1145/2518102
– volume: 7
  start-page: 529
  issue: 4
  year: 2011
  end-page: 539
  ident: Bib0047
  article-title: Smart grid technologies: Communication technologies and standards
  publication-title: IEEE Trans. Industr. Inf.
  doi: 10.1109/TII.2011.2166794
– volume: 30
  start-page: 20
  issue: 1
  year: 2006
  end-page: 28
  ident: Bib0141
  article-title: Virtual reality and mixed reality for virtual learning environments
  publication-title: Comput. Graph.
  doi: 10.1016/j.cag.2005.10.004
– volume: 104
  start-page: 2
  issue: 1
  year: 1993
  end-page: 34
  ident: Bib0011
  article-title: Model-checking in dense real-time
  publication-title: Inf. Comput.
  doi: 10.1006/inco.1993.1024
– start-page: 621
  year: 2007
  end-page: 628
  ident: Bib0042
  article-title: Exposing private information by timing web applications
  publication-title: WWW
  doi: 10.1145/1242572.1242656
– volume: 50
  start-page: 42:1–42:8
  issue: 3
  year: 2017
  ident: Bib0097
  article-title: Corrections to ”a menagerie of timed automata”
  publication-title: Comput. Surv.
  doi: 10.1145/3078809
– year: 2022
  ident: Bib0020
  article-title: Guaranteeing timed opacity using parametric timed model checking
– volume: 50
  start-page: 6:1–6:39
  issue: 1
  year: 2017
  ident: Bib0040
  article-title: A survey of timing channels and countermeasures
  publication-title: Comput. Surv.
  doi: 10.1145/3023872
– volume: 28
  start-page: 1619
  issue: 11–12
  year: 2018
  end-page: 1636
  ident: Bib0130
  article-title: Modeling and verification of IEEE 802.11i security protocol in UPPAAL for internet of things
  publication-title: Int. J. Softw. Eng. Knowl. Eng.
  doi: 10.1142/S021819401840020X
– volume: 65
  start-page: 1:1–1:41
  issue: 1
  year: 2018
  ident: Bib0002
  article-title: The applied pi calculus: Mobile values, new names, and secure communication
  publication-title: J. ACM
  doi: 10.1145/3127586
– volume: 17
  start-page: 4
  issue: 1
  year: 2005
  end-page: 23
  ident: Bib0094
  article-title: A generalized temporal role-based access control model
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2005.1
– volume: 10805
  start-page: 61
  year: 2018
  end-page: 78
  ident: Bib0184
  article-title: Verified model checking of timed automata
  publication-title: TACAS, Part I
  doi: 10.1007/978-3-319-89960-2_4
– volume: 41
  start-page: 3
  issue: 1
  year: 2015
  end-page: 18
  ident: Bib0180
  article-title: A systematic study on explicit-state non-zenoness checking for timed automata
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.2014.2359893
– volume: 85
  start-page: 313
  issue: 1-4
  year: 2008
  end-page: 328
  ident: Bib0095
  article-title: VerICS 2007—A model checker for knowledge and real-time
  publication-title: Fundam. Inf.
– volume: 951
  start-page: 25
  year: 2019
  end-page: 35
  ident: Bib0191
  article-title: Efficient verification of security protocols time properties using SMT solvers
  publication-title: CISIS-ICEUTE
  doi: 10.1007/978-3-030-20005-3_3
– volume: 7273
  start-page: 84
  year: 2012
  end-page: 100
  ident: Bib0098
  article-title: Beyond lassos: Complete SMT-based bounded model checking for timed automata
  publication-title: FMOODS-FORTE
  doi: 10.1007/978-3-642-30793-5_6
– volume: 24
  start-page: 55
  issue: 1
  year: 2014
  end-page: 87
  ident: Bib0104
  article-title: Attack-defense trees
  publication-title: J. Logic Comput.
  doi: 10.1093/logcom/exs029
– volume: 44
  start-page: 725
  issue: 8
  year: 2018
  end-page: 746
  ident: Bib0125
  article-title: A formal specification and verification framework for timed security protocols
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.2017.2712621
– volume: 8666
  start-page: 326
  year: 2014
  end-page: 341
  ident: Bib0107
  article-title: Safety and security interactions modeling using the BDMP formalism: Case study of a pipeline
  publication-title: SAFECOMP
  doi: 10.1007/978-3-319-10506-2_22
– volume: 10802
  start-page: 56
  year: 2018
  end-page: 73
  ident: Bib0110
  article-title: Effective analysis of attack trees: A model-driven approach
  publication-title: FASE
  doi: 10.1007/978-3-319-89363-1_4
– volume: 11022
  start-page: 1
  year: 2018
  end-page: 17
  ident: Bib0021
  article-title: TCTL model checking lower/upper-bound parametric timed automata without invariants
  publication-title: FORMATS
  doi: 10.1007/978-3-030-00151-3_3
– volume: 10744
  start-page: 75
  year: 2017
  end-page: 90
  ident: Bib0082
  article-title: Quantitative evaluation of attack defense trees using stochastic timed automata
  publication-title: GraMSec
  doi: 10.1007/978-3-319-74860-3_5
– volume: 5185
  start-page: 48
  year: 2008
  end-page: 58
  ident: Bib0148
  article-title: A spatio-temporal access control model supporting delegation for pervasive computing applications
  publication-title: TrustBus’08
  doi: 10.1007/978-3-540-85735-8_6
– volume: 9635
  start-page: 163
  year: 2016
  end-page: 185
  ident: Bib0086
  article-title: The value of attack-defence diagrams
  publication-title: POST
  doi: 10.1007/978-3-662-49635-0_9
– volume: 3185
  start-page: 1
  year: 2004
  end-page: 24
  ident: Bib0015
  article-title: Decision problems for timed automata: A survey
  publication-title: SFM-RT
  doi: 10.1007/978-3-540-30080-9_1
– volume: 3653
  start-page: 66
  year: 2005
  end-page: 80
  ident: Bib0051
  article-title: Efficient on-the-fly algorithms for the analysis of timed games
  publication-title: CONCUR
  doi: 10.1007/11539452_9
– volume: 52–53
  start-page: 183
  year: 2002
  end-page: 220
  ident: Bib0088
  article-title: Linear parametric model checking of timed automata
  publication-title: J. Logic Algebr. Program.
  doi: 10.1016/S1567-8326(02)00037-1
– volume: 12531
  start-page: 3
  year: 2020
  end-page: 19
  ident: Bib0026
  article-title: Hackers vs. security: Attack-defence trees as asynchronous multi-agent systems
  publication-title: ICFEM
  doi: 10.1007/978-3-030-63406-3_1
– start-page: 181
  year: 2021
  end-page: 188
  ident: Bib0162
  article-title: Time influence on security protocol
  publication-title: ENASE
  doi: 10.5220/0010388701810188
– volume: 15
  start-page: 619
  issue: 6
  year: 2007
  end-page: 645
  ident: Bib0056
  article-title: Timed analysis of security protocols
  publication-title: J. Comput. Secur.
– volume: 36
  start-page: 719
  issue: 5
  year: 2010
  end-page: 734
  ident: Bib0120
  article-title: Time and probability-based information flow analysis
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.2010.4
– volume: 10314
  start-page: 487
  year: 2017
  end-page: 504
  ident: Bib0192
  article-title: Simple SMT-based bounded model checking for timed interpreted systems
  publication-title: IJCRS, Part II
  doi: 10.1007/978-3-319-60840-2_35
– volume: 10804
  start-page: 28
  year: 2018
  end-page: 52
  ident: Bib0172
  article-title: Secure information release in timed automata
  publication-title: POST
  doi: 10.1007/978-3-319-89722-6_2
– volume: 75
  start-page: 17
  issue: 1
  year: 2002
  end-page: 29
  ident: Bib0189
  article-title: Fuzzy assessment of FMEA for engine systems
  publication-title: Reliabil. Eng. Syst. Safety
  doi: 10.1016/S0951-8320(01)00101-6
– volume: 415
  start-page: 653
  year: 2021
  end-page: 660
  ident: Bib0009
  article-title: Simplified timed attack trees
  publication-title: RCIS
  doi: 10.1007/978-3-030-75018-3_49
– volume: 11750
  start-page: 236
  year: 2019
  end-page: 243
  ident: Bib0182
  article-title: Munta: A verified model checker for timed automata
  publication-title: FORMATS
  doi: 10.1007/978-3-030-29662-9_14
– volume: 52
  start-page: 75:1–75:36
  issue: 4
  year: 2019
  ident: Bib0181
  article-title: Beyond 2014: Formal methods for attack tree-based security modeling
  publication-title: Comput. Surv.
  doi: 10.1145/3331524
– start-page: 1
  year: 2010
  end-page: 8
  ident: Bib0005
  article-title: Exploiting timed automata-based fuzzy controllers and data mining to detect computer network intrusions
  publication-title: FUZZ-IEEE
  doi: 10.1109/FUZZY.2010.5584893
– volume: 3685
  start-page: 221
  year: 2005
  end-page: 234
  ident: Bib0078
  article-title: Generalized abstract non-interference: Abstract secure information-flow analysis for automata
  publication-title: MMM-ACNS
  doi: 10.1007/11560326_17
– volume: 68
  start-page: 817
  year: 2020
  end-page: 850
  ident: Bib0092
  article-title: Towards partial order reductions for strategic ability
  publication-title: J. Artif. Intell. Res.
  doi: 10.1613/jair.1.11936
– volume: 852
  start-page: 19
  year: 2019
  end-page: 29
  ident: Bib0165
  article-title: Network’s delays in timed analysis of security protocols
  publication-title: ISAT
  doi: 10.1007/978-3-319-99981-4_3
– volume: 62
  start-page: 229
  year: 2001
  end-page: 243
  ident: Bib0069
  article-title: Formal models of timing attacks on web privacy
  publication-title: Electr. Not. Theor. Comput. Sci.
  doi: 10.1016/S1571-0661(04)00329-9
– volume: 180
  start-page: 35
  issue: 1
  year: 2007
  end-page: 53
  ident: Bib0074
  article-title: Non-interference control synthesis for security timed automata
  publication-title: Electr. Not. Theor. Comput. Sci.
  doi: 10.1016/j.entcs.2005.05.046
– volume: 3657
  start-page: 162
  year: 2004
  end-page: 182
  ident: Bib0033
  article-title: Priced timed automata: Algorithms and applications
  publication-title: FMCO
  doi: 10.1007/11561163_8
– volume: 79
  start-page: 453
  issue: 3–4
  year: 2007
  end-page: 471
  ident: Bib0113
  article-title: Verifying security protocols modelled by networks of automata
  publication-title: Fundam. Inf.
– volume: 12524
  start-page: 30
  year: 2020
  end-page: 42
  ident: Bib0127
  article-title: Modeling attack-defense trees’ countermeasures using continuous time markov chains
  publication-title: ASYDE
  doi: 10.1007/978-3-030-67220-1_3
– volume: 29
  start-page: 38
  issue: 2
  year: 1996
  end-page: 47
  ident: Bib0152
  article-title: Role-based access control models
  publication-title: Computer
  doi: 10.1109/2.485845
– start-page: 570
  year: 2019
  end-page: 577
  ident: Bib0108
  article-title: A new model-based framework for testing security of IoT systems in smart cities using attack trees and price timed automata
  publication-title: ENASE
  doi: 10.5220/0007830605700577
– year: 2006
  ident: Bib0079
  article-title: Modelling and verification of security protocols for ad hoc networks using UPPAAL
  publication-title: NWPT
– volume: 52
  start-page: 1227
  issue: 5
  year: 2005
  end-page: 1235
  ident: Bib0132
  article-title: Scrub nurse robot system-intraoperative motion analysis of a scrub nurse and timed-automata-based model for surgery
  publication-title: IEEE Trans. Industr. Electr.
  doi: 10.1109/TIE.2005.855692
– volume: 4
  start-page: 191
  issue: 3
  year: 2001
  end-page: 233
  ident: Bib0037
  article-title: TRBAC: A temporal role-based access control model
  publication-title: ACM Trans. Inf. Syst. Secur.
  doi: 10.1145/501978.501979
– start-page: 190
  year: 2011
  end-page: 199
  ident: Bib0126
  article-title: PAT 3: An extensible architecture for building multi-domain model checkers
  publication-title: ISSRE
  doi: 10.1109/ISSRE.2011.19
– volume: 21
  start-page: 993
  issue: 12
  year: 1978
  end-page: 999
  ident: Bib0136
  article-title: Using encryption for authentication in large networks of computers
  publication-title: Commun. ACM
  doi: 10.1145/359657.359659
– volume: 9035
  start-page: 206
  year: 2015
  end-page: 211
  ident: Bib0058
  article-title: Uppaal stratego
  publication-title: TACAS
  doi: 10.1007/978-3-662-46681-0_16
– volume: 93
  start-page: 245
  issue: 1–3
  year: 2009
  end-page: 259
  ident: Bib0114
  article-title: Timed automata based model checking of timed security protocols
  publication-title: Fundam. Inf.
  doi: 10.3233/FI-2009-0100
– volume: 8
  start-page: 521
  issue: 5
  year: 2002
  end-page: 534
  ident: Bib0144
  article-title: SPINS: Security protocols for sensor networks
  publication-title: Wireless Netw.
  doi: 10.1023/A:1016598314198
– volume: 23
  start-page: 598
  issue: 3
  year: 2005
  end-page: 610
  ident: Bib0153
  article-title: Authenticated routing for ad hoc networks
  publication-title: IEEE J. Select. Areas Commun.
  doi: 10.1109/JSAC.2004.842547
– volume: 6275
  start-page: 1
  year: 2011
  end-page: 169
  ident: Bib0142
  article-title: Mobility support in IPv6
  publication-title: RFC
  doi: 10.17487/RFC6275
– year: 2006
  ident: Bib0084
  article-title: Timed automata based analysis of embedded system architectures
  publication-title: IPDPS
  doi: 10.1109/IPDPS.2006.1639422
– volume: 12740
  start-page: 39
  year: 2021
  end-page: 50
  ident: Bib0023
  article-title: A benchmarks library for extended timed automata
  publication-title: TAP
  doi: 10.1007/978-3-030-79379-1_3
– volume: 10953
  start-page: 27
  year: 2018
  end-page: 43
  ident: Bib0076
  article-title: Model checking the information flow security of real-time systems
  publication-title: ESSoS
  doi: 10.1007/978-3-319-94496-8_3
– volume: 6
  start-page: 685
  issue: 4
  year: 1988
  end-page: 696
  ident: Bib0151
  article-title: Telecommunications management network (TMN) architecture and interworking designs
  publication-title: IEEE J. Select. Areas Commun.
  doi: 10.1109/49.1940
– volume: 9
  start-page: 1072
  issue: 10
  year: 2016
  end-page: 1084
  ident: Bib0150
  article-title: Security analysis of network protocols through model checking: A case study on mobile IPv6
  publication-title: Secur. Commun. Netw.
  doi: 10.1002/sec.1401
– volume: 21
  start-page: 3055
  issue: 9
  year: 2021
  ident: Bib0166
  article-title: SAT and SMT-based verification of security protocols including time aspects
  publication-title: Sensors
  doi: 10.3390/s21093055
– volume: 8413
  start-page: 310
  year: 2014
  end-page: 325
  ident: Bib0179
  article-title: Are timed automata bad for a specification language? language inclusion checking for timed automata
  publication-title: TACAS
  doi: 10.1007/978-3-642-54862-8_21
– volume: 9884
  start-page: 35
  year: 2016
  end-page: 50
  ident: Bib0073
  article-title: Modelling attack-defense trees using timed automata
  publication-title: FORMATS
  doi: 10.1007/978-3-319-44878-7_3
– volume: 54
  start-page: 137
  issue: 2–3
  year: 2003
  end-page: 150
  ident: Bib0030
  article-title: A decidable notion of timed non-interference
  publication-title: Fundam. Inf.
– volume: 3
  start-page: 779
  issue: 10
  year: 2010
  end-page: 787
  ident: Bib0057
  article-title: A comparative analysis of tools for verification of security protocols
  publication-title: Int. J. Commun. Netw. Syst. Sci.
  doi: 10.4236/ijcns.2010.310104
– volume: 12288
  start-page: 58
  year: 2020
  end-page: 75
  ident: Bib0183
  article-title: Certifying emptiness of timed büchi automata
  publication-title: FORMATS
  doi: 10.1007/978-3-030-57628-8_4
– volume: 61
  start-page: 1
  year: 2021
  end-page: 13
  ident: Bib0016
  article-title: Bounded opacity for timed systems
  publication-title: J. Inf. Secur. Appl.
  doi: 10.1016/j.jisa.2021.102926
– volume: 5
  start-page: 141
  year: 2012
  end-page: 159
  ident: Bib0099
  article-title: Bounded model checking for parametric timed automata
  publication-title: Trans. Petri Nets Other Models Concurr.
  doi: 10.1007/978-3-642-29072-5_6
– volume: 173
  start-page: 13
  year: 2005
  end-page: 26
  ident: Bib0119
  article-title: Information flow analysis for probabilistic timed automata
  publication-title: FAST
  doi: 10.1007/0-387-24098-5_2
– volume: 63
  start-page: 93
  issue: 7
  year: 2020
  end-page: 101
  ident: Bib0100
  article-title: Spectre attacks: Exploiting speculative execution
  publication-title: Commun. ACM
  doi: 10.1145/3399742
– start-page: 223
  year: 2012
  end-page: 254
  ident: Bib0115
  article-title: Applying timed automata to model checking of security protocols
  publication-title: Handbook of Finite State Based Models and Applications
  doi: 10.1201/b13055-12
– start-page: 86
  year: 2010
  end-page: 93
  ident: Bib0102
  article-title: Utilization of timed automata as a verification tool for security protocols
  publication-title: SSIRI
  doi: 10.1109/SSIRI-C.2010.27
– volume: 10322
  start-page: 247
  year: 2017
  end-page: 267
  ident: Bib0156
  article-title: Fantastic timers and where to find them: High-resolution microarchitectural attacks in javascript
  publication-title: FC
  doi: 10.1007/978-3-319-70972-7_13
– volume: 969
  start-page: 529
  year: 1995
  end-page: 539
  ident: Bib0121
  article-title: From timed automata to logic—and back
  publication-title: MFCS
  doi: 10.1007/3-540-60246-1_158
– volume: 18
  start-page: 453
  issue: 8
  year: 1975
  end-page: 457
  ident: Bib0062
  article-title: Guarded commands, nondeterminacy and formal derivation of programs
  publication-title: Commun. ACM
  doi: 10.1145/360933.360975
– volume: 9871
  start-page: 138
  year: 2016
  end-page: 153
  ident: Bib0093
  article-title: A stochastic framework for quantitative analysis of attack-defense trees
  publication-title: STM
  doi: 10.1007/978-3-319-46598-2_10
– volume: 38
  start-page: 393
  issue: 4
  year: 2002
  end-page: 422
  ident: Bib0008
  article-title: Wireless sensor networks: A survey
  publication-title: Comput. Netw.
  doi: 10.1016/S1389-1286(01)00302-4
– start-page: 534
  year: 2017
  end-page: 540
  ident: Bib0178
  article-title: Formal analysis of security properties of cyber-physical system based on timed automata
  publication-title: DSC
  doi: 10.1109/DSC.2017.44
– volume: 21
  start-page: 203
  issue: 2
  year: 2019
  end-page: 219
  ident: Bib0017
  article-title: What’s decidable about parametric timed automata?
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s10009-017-0467-0
– start-page: 165
  year: 2004
  end-page: 176
  ident: Bib0131
  article-title: Using unification for opacity properties
  publication-title: WITS
– volume: 1
  start-page: 134
  issue: 1–2
  year: 1997
  end-page: 152
  ident: Bib0122
  article-title: UPPAAL in a nutshell
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s100090050010
– volume: 88
  start-page: 217
  issue: 2
  year: 2015
  end-page: 236
  ident: Bib0035
  article-title: Control and synthesis of non-interferent timed systems
  publication-title: Int. J. Contr.
  doi: 10.1080/00207179.2014.944356
– volume: 42
  start-page: 1:1–1:31
  issue: 1
  year: 2009
  ident: Bib0087
  article-title: A survey of attack and defense techniques for reputation systems
  publication-title: Comput. Surv.
  doi: 10.1145/1592451.1592452
– volume: 6
  start-page: 3
  issue: 1
  year: 2001
  end-page: 23
  ident: Bib0063
  article-title: Real-time automata
  publication-title: J. Autom. Lang. Combin.
  doi: 10.25596/jalc-2001-003
– volume: 152
  start-page: 411
  issue: 4
  year: 2017
  end-page: 433
  ident: Bib0188
  article-title: SMT-based searching for k-quasi-optimal runs in weighted timed automata
  publication-title: Fundam. Inf.
  doi: 10.3233/FI-2017-1527
– volume: 6806
  start-page: 379
  year: 2011
  end-page: 395
  ident: Bib0072
  article-title: SpaceEx: Scalable verification of hybrid systems
  publication-title: CAV
  doi: 10.1007/978-3-642-22110-1_30
– volume: 32
  start-page: 812
  issue: 10
  year: 2006
  end-page: 830
  ident: Bib0041
  article-title: MODEST: A compositional modeling formalism for hard and softly timed systems
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.2006.104
– volume: 7
  start-page: 247
  issue: 3
  year: 1989
  end-page: 280
  ident: Bib0155
  article-title: Integrating security in a large distributed system
  publication-title: ACM Trans. Comput. Syst.
  doi: 10.1145/65000.65002
– volume: 21
  start-page: 50
  issue: 6
  year: 2001
  end-page: 54
  ident: Bib0154
  article-title: Radio frequency identification and the electronic product code
  publication-title: IEEE Micro
  doi: 10.1109/40.977758
– volume: 5576
  start-page: 21
  year: 2009
  end-page: 30
  ident: Bib0050
  article-title: The dark side of timed opacity
  publication-title: ISA
  doi: 10.1007/978-3-642-02617-1_3
– year: 1995
  ident: Bib0081
  publication-title: Formal Design of Reliable Real Time Systems
– volume: 1
  start-page: 123
  issue: 1-2
  year: 1997
  end-page: 133
  ident: Bib0190
  article-title: KRONOS: A verification tool for real-time systems
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s100090050009
– start-page: 25
  year: 2000
  end-page: 32
  ident: Bib0068
  article-title: Timing attacks on web privacy
  publication-title: CCS
  doi: 10.1145/352600.352606
– volume: 29
  start-page: 198
  issue: 2
  year: 1983
  end-page: 207
  ident: Bib0065
  article-title: On the security of public key protocols
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1983.1056650
– volume: 9995
  start-page: 513
  year: 2016
  end-page: 530
  ident: Bib0124
  article-title: Automated verification of timed security protocols with clock drift
  publication-title: FM
  doi: 10.1007/978-3-319-48989-6_31
– start-page: 186
  year: 2004
  end-page: 197
  ident: Bib0077
  article-title: Abstract non-interference: Parameterizing non-interference by abstract interpretation
  publication-title: POPL
  doi: 10.1145/964001.964017
– volume: 6561
  start-page: 80
  year: 2010
  end-page: 95
  ident: Bib0103
  article-title: Foundations of attack-defense trees
  publication-title: FAST
  doi: 10.1007/978-3-642-19751-2_6
– start-page: 1
  year: 2012
  end-page: 6
  ident: Bib0075
  article-title: Verification of spatio-temporal role based access control using timed automata
  publication-title: NESEA
  doi: 10.1109/NESEA.2012.6474023
– start-page: 170
  year: 2000
  end-page: 184
  ident: Bib0070
  article-title: Information flow analysis in a discrete-time process algebra
  publication-title: CSFW
  doi: 10.1109/CSFW.2000.856935
– volume: 290
  start-page: 241
  issue: 1
  year: 2003
  end-page: 264
  ident: Bib0004
  article-title: Model checking of systems with many identical timed processes
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00330-9
– volume: 9268
  start-page: 156
  year: 2015
  end-page: 171
  ident: Bib0109
  article-title: Quantitative attack tree analysis via priced timed automata
  publication-title: FORMATS
  doi: 10.1007/978-3-319-22975-1_11
– volume: 17
  start-page: 93
  issue: 3
  year: 1996
  end-page: 102
  ident: Bib0129
  article-title: Breaking and fixing the needham-schroeder public-key protocol using FDR
  publication-title: Softw. Concepts Tools
– volume: 3576
  start-page: 281
  year: 2005
  end-page: 285
  ident: Bib0027
  article-title: The AVISPA tool for the automated validation of internet security protocols and applications
  publication-title: CAV
  doi: 10.1007/11513988_27
– volume: 24
  start-page: 501
  year: 2013
  end-page: 513
  ident: Bib0038
  article-title: Parameterized verification of many identical probabilistic timed processes
  publication-title: FSTTCS
  doi: 10.4230/LIPIcs.FSTTCS.2013.501
– volume: 1485
  start-page: 361
  year: 1998
  end-page: 375
  ident: Bib0034
  article-title: Kerberos version 4: Inductive analysis of the secrecy goals
  publication-title: ESORICS
  doi: 10.1007/BFb0055875
– volume: 46
  start-page: 1795
  issue: 9–11
  year: 2006
  end-page: 1799
  ident: Bib0049
  article-title: Failure analysis-assisted FMEA
  publication-title: Microelectr. Reliabil.
  doi: 10.1016/j.microrel.2006.07.072
– start-page: 280
  year: 1999
  end-page: 286
  ident: Bib0067
  article-title: Scheduling a steel plant with timed automata
  publication-title: RTCSA
  doi: 10.1109/RTCSA.1999.811256
– start-page: 278
  year: 1996
  end-page: 292
  ident: Bib0085
  article-title: The theory of hybrid automata
  publication-title: LiCS
  doi: 10.1109/LICS.1996.561342
– volume: 28
  start-page: 24
  issue: 3
  year: 1994
  end-page: 37
  ident: Bib0186
  article-title: A lesson on authentication protocol design
  publication-title: ACM SIGOPS Operat. Syst. Rev.
  doi: 10.1145/182110.182113
– start-page: 21
  year: 2015
  end-page: 28
  ident: Bib0060
  article-title: Modelling social-technical attacks with timed automata
  publication-title: MIST
  doi: 10.1145/2808783.2808787
– volume: 9
  start-page: 1
  year: 2013
  end-page: 26
  ident: Bib0175
  article-title: A survey of timed automata for the development of real-time systems
  publication-title: Comput. Sci. Rev.
  doi: 10.1016/j.cosrev.2013.05.001
– year: 2005
  ident: Bib0167
  article-title: Minisat v1.13-a SAT solver with conflict-clause minimization
– volume: 211
  start-page: 253
  issue: 1–2
  year: 1999
  end-page: 273
  ident: Bib0013
  article-title: Event-clock automata: A determinizable class of timed automata
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00173-4
– ident: Bib0001
  article-title: Uppaal CORA
– volume: 17
  start-page: 397
  issue: 4
  year: 2015
  end-page: 415
  ident: Bib0059
  article-title: Uppaal SMC tutorial
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s10009-014-0361-y
– volume: 30
  start-page: 255
  issue: 3–4
  year: 2015
  end-page: 283
  ident: Bib0083
  article-title: Automata-based refinement checking for real-time systems
  publication-title: Comput. Sci. Res. Dev.
  doi: 10.1007/s00450-014-0257-9
– volume: 24
  start-page: 61
  year: 2015
  end-page: 76
  ident: Bib0161
  article-title: Modeling and verifying EPC network intrusion system based on timed automata
  publication-title: Perv. Mobile Comput.
  doi: 10.1016/j.pmcj.2015.06.007
– ident: e_1_3_2_85_2
  doi: 10.1109/IPDPS.2006.1639422
– ident: e_1_3_2_134_2
  doi: 10.1016/j.jnca.2012.05.003
– ident: e_1_3_2_136_2
  doi: 10.1016/j.cose.2010.09.002
– ident: e_1_3_2_7_2
  doi: 10.1016/S0304-3975(02)00334-1
– ident: e_1_3_2_49_2
  doi: 10.1145/234313.234418
– ident: e_1_3_2_178_2
  doi: 10.1109/TCAD.2018.2857363
– ident: e_1_3_2_182_2
  doi: 10.1145/3331524
– ident: e_1_3_2_180_2
  doi: 10.1007/978-3-642-54862-8_21
– ident: e_1_3_2_107_2
  doi: 10.1145/2508859.2516712
– ident: e_1_3_2_63_2
  doi: 10.1145/360933.360975
– ident: e_1_3_2_102_2
  doi: 10.1007/3-540-68697-5_9
– ident: e_1_3_2_11_2
  doi: 10.1109/ISCAS.2019.8702440
– ident: e_1_3_2_57_2
  doi: 10.5555/1370677.1370679
– ident: e_1_3_2_72_2
  doi: 10.1145/2518102
– ident: e_1_3_2_61_2
  doi: 10.1145/2808783.2808787
– ident: e_1_3_2_157_2
  doi: 10.1007/978-3-319-70972-7_13
– ident: e_1_3_2_81_2
  doi: 10.1007/978-3-540-75454-1_15
– ident: e_1_3_2_46_2
  doi: 10.1016/j.ijcip.2012.08.002
– ident: e_1_3_2_15_2
  doi: 10.1145/167088.167242
– ident: e_1_3_2_149_2
  doi: 10.1007/978-3-540-85735-8_6
– ident: e_1_3_2_39_2
  doi: 10.4230/LIPIcs.FSTTCS.2013.501
– ident: e_1_3_2_164_2
  doi: 10.17512/jamcm.2015.3.14
– ident: e_1_3_2_174_2
  doi: 10.1109/CSF.2019.00010
– ident: e_1_3_2_2_2
– ident: e_1_3_2_60_2
  doi: 10.1007/s10009-014-0361-y
– ident: e_1_3_2_148_2
  doi: 10.1007/978-3-319-39426-8_13
– ident: e_1_3_2_9_2
  doi: 10.1016/S1389-1286(01)00302-4
– ident: e_1_3_2_79_2
  doi: 10.1007/11560326_17
– ident: e_1_3_2_31_2
  doi: 10.5555/2370741.2370744
– ident: e_1_3_2_87_2
  doi: 10.1007/978-3-662-49635-0_9
– ident: e_1_3_2_45_2
  doi: 10.1007/s10207-008-0058-x
– ident: e_1_3_2_111_2
  doi: 10.1007/978-3-319-89363-1_4
– ident: e_1_3_2_75_2
  doi: 10.1016/j.entcs.2005.05.046
– ident: e_1_3_2_177_2
  doi: 10.1007/978-3-030-01461-2_3
– ident: e_1_3_2_69_2
  doi: 10.1145/352600.352606
– ident: e_1_3_2_122_2
  doi: 10.1007/3-540-60246-1_158
– ident: e_1_3_2_191_2
  doi: 10.1007/s100090050009
– ident: e_1_3_2_86_2
  doi: 10.1109/LICS.1996.561342
– ident: e_1_3_2_3_2
  doi: 10.1145/3127586
– ident: e_1_3_2_16_2
  doi: 10.1007/978-3-540-30080-9_1
– ident: e_1_3_2_5_2
  doi: 10.1016/S0304-3975(01)00330-9
– ident: e_1_3_2_116_2
  doi: 10.1201/b13055-12
– ident: e_1_3_2_58_2
  doi: 10.4236/ijcns.2010.310104
– ident: e_1_3_2_59_2
  doi: 10.1007/978-3-662-46681-0_16
– ident: e_1_3_2_76_2
  doi: 10.1109/NESEA.2012.6474023
– ident: e_1_3_2_98_2
  doi: 10.1145/3078809
– ident: e_1_3_2_119_2
  doi: 10.1109/SEFM.2003.1236205
– ident: e_1_3_2_12_2
  doi: 10.1006/inco.1993.1024
– ident: e_1_3_2_142_2
  doi: 10.1016/j.cag.2005.10.004
– ident: e_1_3_2_21_2
  doi: 10.1145/3502851
– ident: e_1_3_2_30_2
  doi: 10.5555/2371116.2371118
– ident: e_1_3_2_103_2
  doi: 10.1109/SSIRI-C.2010.27
– start-page: 2123
  volume-title: AAMAS
  year: 2020
  ident: e_1_3_2_194_2
– ident: e_1_3_2_28_2
  doi: 10.1007/11513988_27
– ident: e_1_3_2_62_2
  doi: 10.1145/3214292.3214294
– ident: e_1_3_2_17_2
  doi: 10.1016/j.jisa.2021.102926
– ident: e_1_3_2_123_2
  doi: 10.1007/s100090050010
– ident: e_1_3_2_181_2
  doi: 10.1109/TSE.2014.2359893
– ident: e_1_3_2_74_2
  doi: 10.1007/978-3-319-44878-7_3
– ident: e_1_3_2_166_2
  doi: 10.1007/978-3-319-99981-4_3
– ident: e_1_3_2_64_2
  doi: 10.25596/jalc-2001-003
– ident: e_1_3_2_91_2
  doi: 10.5555/2367396.2367405
– ident: e_1_3_2_131_2
  doi: 10.1142/S021819401840020X
– ident: e_1_3_2_160_2
  doi: 10.1007/s12927-019-0003-8
– ident: e_1_3_2_26_2
  doi: 10.1145/2896386
– ident: e_1_3_2_101_2
  doi: 10.1145/3399742
– ident: e_1_3_2_68_2
  doi: 10.1109/RTCSA.1999.811256
– ident: e_1_3_2_53_2
  doi: 10.1007/BFb0025774
– ident: e_1_3_2_165_2
  doi: 10.1007/978-3-319-46586-9_5
– volume: 85
  start-page: 313
  issue: 1
  year: 2008
  ident: e_1_3_2_96_2
  article-title: VerICS 2007—A model checker for knowledge and real-time
  publication-title: Fundam. Inf.
– ident: e_1_3_2_20_2
  doi: 10.1109/ICECCS51672.2020.00012
– ident: e_1_3_2_84_2
  doi: 10.1007/s00450-014-0257-9
– ident: e_1_3_2_42_2
  doi: 10.1109/TSE.2006.104
– ident: e_1_3_2_48_2
  doi: 10.1109/TII.2011.2166794
– ident: e_1_3_2_65_2
  doi: 10.1016/0196-6774(82)90004-9
– ident: e_1_3_2_120_2
  doi: 10.1007/0-387-24098-5_2
– ident: e_1_3_2_105_2
  doi: 10.1093/logcom/exs029
– ident: e_1_3_2_71_2
  doi: 10.1109/CSFW.2000.856935
– start-page: 100
  volume-title: CS&P
  year: 2005
  ident: e_1_3_2_92_2
– ident: e_1_3_2_56_2
  doi: 10.1145/1029133.1029137
– ident: e_1_3_2_89_2
  doi: 10.1016/S1567-8326(02)00037-1
– ident: e_1_3_2_6_2
  doi: 10.1109/FUZZY.2010.5584893
– ident: e_1_3_2_66_2
  doi: 10.1109/TIT.1983.1056650
– ident: e_1_3_2_190_2
  doi: 10.1016/S0951-8320(01)00101-6
– ident: e_1_3_2_114_2
  doi: 10.5555/2367396.2367411
– ident: e_1_3_2_14_2
  doi: 10.1016/S0304-3975(97)00173-4
– ident: e_1_3_2_135_2
  doi: 10.1109/IAS.2008.10
– ident: e_1_3_2_128_2
  doi: 10.1007/978-3-030-67220-1_3
– ident: e_1_3_2_24_2
  doi: 10.1007/978-3-030-79379-1_3
– ident: e_1_3_2_179_2
  doi: 10.1109/DSC.2017.44
– ident: e_1_3_2_113_2
  doi: 10.1007/978-3-319-46586-9_6
– ident: e_1_3_2_171_2
  doi: 10.1109/CCNC46108.2020.9045724
– ident: e_1_3_2_4_2
  doi: 10.1016/j.tcs.2015.07.048
– ident: e_1_3_2_37_2
  doi: 10.4304/jcp.4.5.366-377
– ident: e_1_3_2_18_2
  doi: 10.1007/s10009-017-0467-0
– ident: e_1_3_2_99_2
  doi: 10.1007/978-3-642-30793-5_6
– ident: e_1_3_2_50_2
  doi: 10.1016/j.microrel.2006.07.072
– volume-title: NDSS
  year: 2001
  ident: e_1_3_2_144_2
– ident: e_1_3_2_143_2
  doi: 10.17487/RFC6275
– ident: e_1_3_2_40_2
  doi: 10.1016/S0065-2458(03)58003-2
– ident: e_1_3_2_169_2
  doi: 10.1007/978-3-642-32122-1
– ident: e_1_3_2_118_2
  doi: 10.1145/7351.7352
– ident: e_1_3_2_187_2
  doi: 10.1145/182110.182113
– ident: e_1_3_2_172_2
  doi: 10.4230/LIPIcs.TIME.2017.21
– ident: e_1_3_2_112_2
  doi: 10.1109/HASE.2017.12
– ident: e_1_3_2_35_2
  doi: 10.1007/BFb0055875
– ident: e_1_3_2_129_2
  doi: 10.1016/0020-0190(95)00144-2
– ident: e_1_3_2_25_2
  doi: 10.1007/978-3-319-10512-3_2
– ident: e_1_3_2_47_2
  doi: 10.1145/77648.77649
– ident: e_1_3_2_188_2
  doi: 10.1007/s11225-015-9637-9
– ident: e_1_3_2_32_2
  doi: 10.1016/S0304-3975(01)00215-8
– ident: e_1_3_2_22_2
  doi: 10.1007/978-3-030-00151-3_3
– ident: e_1_3_2_133_2
  doi: 10.1109/TIE.2005.855692
– ident: e_1_3_2_153_2
  doi: 10.1109/2.485845
– ident: e_1_3_2_29_2
  doi: 10.1007/s00165-012-0269-9
– ident: e_1_3_2_154_2
  doi: 10.1109/JSAC.2004.842547
– ident: e_1_3_2_54_2
  doi: 10.1016/B978-044450813-3/50026-6
– ident: e_1_3_2_67_2
  doi: 10.1007/978-3-319-08867-9_49
– ident: e_1_3_2_108_2
  doi: 10.1007/978-3-319-10506-2_22
– ident: e_1_3_2_146_2
  doi: 10.1109/ICECCS.2019.00015
– ident: e_1_3_2_13_2
  doi: 10.1016/0304-3975(94)90010-8
– ident: e_1_3_2_185_2
  doi: 10.1007/978-3-319-89960-2_4
– ident: e_1_3_2_155_2
  doi: 10.1109/40.977758
– ident: e_1_3_2_94_2
  doi: 10.1007/978-3-319-46598-2_10
– ident: e_1_3_2_97_2
  doi: 10.1109/MWC.2007.4396947
– ident: e_1_3_2_163_2
  doi: 10.5220/0010388701810188
– ident: e_1_3_2_95_2
  doi: 10.1109/TKDE.2005.1
– ident: e_1_3_2_140_2
  doi: 10.1007/978-3-319-63121-9_1
– ident: e_1_3_2_192_2
  doi: 10.1007/978-3-030-20005-3_3
– ident: e_1_3_2_77_2
  doi: 10.1007/978-3-319-94496-8_3
– ident: e_1_3_2_186_2
  doi: 10.1007/978-3-030-45190-5_24
– ident: e_1_3_2_126_2
  doi: 10.1109/TSE.2017.2712621
– ident: e_1_3_2_10_2
  doi: 10.1007/978-3-030-75018-3_49
– ident: e_1_3_2_51_2
  doi: 10.1007/978-3-642-02617-1_3
– ident: e_1_3_2_168_2
– ident: e_1_3_2_55_2
  doi: 10.1016/j.scico.2003.12.002
– ident: e_1_3_2_88_2
  doi: 10.1145/1592451.1592452
– ident: e_1_3_2_183_2
  doi: 10.1007/978-3-030-29662-9_14
– volume-title: Fault Tree Handbook
  year: 1981
  ident: e_1_3_2_175_2
– ident: e_1_3_2_110_2
  doi: 10.1007/978-3-319-22975-1_11
– ident: e_1_3_2_176_2
  doi: 10.1016/j.cosrev.2013.05.001
– ident: e_1_3_2_23_2
  doi: 10.3233/FI-2021-2066
– ident: e_1_3_2_19_2
  doi: 10.1007/978-3-030-81685-8_26
– ident: e_1_3_2_150_2
  doi: 10.1016/j.cosrev.2015.03.001
– ident: e_1_3_2_121_2
  doi: 10.1109/TSE.2010.4
– ident: e_1_3_2_100_2
  doi: 10.1007/978-3-642-29072-5_6
– ident: e_1_3_2_162_2
  doi: 10.1016/j.pmcj.2015.06.007
– ident: e_1_3_2_170_2
  doi: 10.1145/1454630.1454638
– ident: e_1_3_2_83_2
  doi: 10.1007/978-3-319-74860-3_5
– ident: e_1_3_2_152_2
  doi: 10.1109/49.1940
– volume: 17
  start-page: 93
  issue: 3
  year: 1996
  ident: e_1_3_2_130_2
  article-title: Breaking and fixing the needham-schroeder public-key protocol using FDR
  publication-title: Softw. Concepts Tools
– ident: e_1_3_2_156_2
  doi: 10.1145/65000.65002
– ident: e_1_3_2_52_2
  doi: 10.1007/11539452_9
– ident: e_1_3_2_33_2
  doi: 10.1016/j.entcs.2004.11.044
– ident: e_1_3_2_124_2
  doi: 10.1109/QEST.2011.34
– ident: e_1_3_2_137_2
  doi: 10.1145/359657.359659
– ident: e_1_3_2_104_2
  doi: 10.1007/978-3-642-19751-2_6
– ident: e_1_3_2_43_2
  doi: 10.1145/1242572.1242656
– ident: e_1_3_2_151_2
  doi: 10.1002/sec.1401
– ident: e_1_3_2_109_2
  doi: 10.5220/0007830605700577
– ident: e_1_3_2_38_2
  doi: 10.1145/501978.501979
– ident: e_1_3_2_8_2
  doi: 10.1051/ita:2000131
– ident: e_1_3_2_44_2
  doi: 10.1007/s10703-009-0074-0
– ident: e_1_3_2_189_2
  doi: 10.3233/FI-2017-1527
– ident: e_1_3_2_141_2
  doi: 10.1007/978-3-642-04081-8_33
– ident: e_1_3_2_161_2
  doi: 10.1016/0020-0255(85)90026-X
– ident: e_1_3_2_117_2
  doi: 10.1016/S0304-3975(01)00046-9
– ident: e_1_3_2_138_2
  doi: 10.1145/155848.155852
– ident: e_1_3_2_34_2
  doi: 10.1007/11561163_8
– ident: e_1_3_2_73_2
  doi: 10.1007/978-3-642-22110-1_30
– ident: e_1_3_2_145_2
  doi: 10.1023/A:1016598314198
– ident: e_1_3_2_158_2
  doi: 10.1007/978-3-030-57805-3_14
– ident: e_1_3_2_173_2
  doi: 10.1007/978-3-319-89722-6_2
– volume-title: NWPT
  year: 2006
  ident: e_1_3_2_80_2
– ident: e_1_3_2_106_2
  doi: 10.1016/j.cosrev.2014.07.001
– volume-title: Formal Design of Reliable Real Time Systems
  year: 1995
  ident: e_1_3_2_82_2
– ident: e_1_3_2_36_2
  doi: 10.1080/00207179.2014.944356
– ident: e_1_3_2_159_2
  doi: 10.17512/jamcm.2016.2.13
– start-page: 165
  volume-title: WITS
  year: 2004
  ident: e_1_3_2_132_2
– volume-title: ICONS
  year: 2014
  ident: e_1_3_2_90_2
– ident: e_1_3_2_78_2
  doi: 10.1145/964001.964017
– ident: e_1_3_2_93_2
  doi: 10.1613/jair.1.11936
– ident: e_1_3_2_70_2
  doi: 10.1016/S1571-0661(04)00329-9
– ident: e_1_3_2_127_2
  doi: 10.1109/ISSRE.2011.19
– ident: e_1_3_2_184_2
  doi: 10.1007/978-3-030-57628-8_4
– ident: e_1_3_2_41_2
  doi: 10.1145/3023872
– ident: e_1_3_2_125_2
  doi: 10.1007/978-3-319-48989-6_31
– ident: e_1_3_2_167_2
  doi: 10.3390/s21093055
– ident: e_1_3_2_195_2
  doi: 10.1109/CCNC.2018.8319187
– ident: e_1_3_2_193_2
  doi: 10.1007/978-3-319-60840-2_35
– ident: e_1_3_2_139_2
  doi: 10.1007/s10009-002-0094-1
– ident: e_1_3_2_27_2
  doi: 10.1007/978-3-030-63406-3_1
– ident: e_1_3_2_147_2
  doi: 10.1515/amcs-2015-0031
– ident: e_1_3_2_115_2
  doi: 10.3233/FI-2009-0100
SSID ssj0002416
Score 2.4901154
Snippet Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks,...
SourceID hal
proquest
crossref
acm
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms attack trees
Automata theory
Clocks
Computer Science
Cryptography and Security
cybersecurity
Formal security models
Formalism
Logic and verification
Logic in Computer Science
opacity
Security
Security and privacy
survey
Theory of computation
Timed and hybrid models
timed automata
Verification by model checking
SubjectTermsDisplay Security and privacy -- Formal security models
Security and privacy -- Logic and verification
Theory of computation -- Timed and hybrid models
Theory of computation -- Verification by model checking
Title Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice
URI https://dl.acm.org/doi/10.1145/3534967
https://www.proquest.com/docview/2823158471
https://hal.science/hal-03690234
Volume 55
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFLcKXLjsgzGtwCZrmnZBYU1i185uEQNViO7Ch7hFjuMIpNIimqCJv37vxXYSyqSNXaLIiZ02v1_ee7bfByFfVKFVHo51UGr43NiokIEslA4USD7OtYEZCMY7T3-OJxfs5IpfDQYnPa-lusoP9OMf40r-B1VoA1wxSvYFyLaDQgOcA75wBITh-G8Y34Au20_ragF2p8KSMWr_GI3QGZa-QAfCo1_W0RXTbrtKdTYW_ay-fwBxANjb6HwXNWBDpvoWa3o4bfzO68Y_etl0W3Y00Tcztwp_3fEMvSTtDjxewjOZVI1nWX-RIYr96mXZBVeNApAHdgvFOFnJRSBim7fKC1Obc9eRpi8Zw56KtSlPngtvhnkuYo457EWnn_ye_Iraap0JbWg1z1zHNbIRwZQBhPRG-mN6etbqZbBV3M61_Ss2hBq7fnNd0ULRt08slLVr9I9dUdON7XH-hrxykwaaWga8JQMz3yKvfUEO6uTzO3LZEIJ6QlC1pIq2hKBACNoRgnpCfKcptXSgizm1dKBAB-rpsE0ujo_ODyeBK5wRKJgBVoHJWVRIoXghhCokT4zIE1GwUazCUWJKyXQMohqtNTBghSxCYThmZoS5psnLPH5P1ueLufmAIf0wpFSxBMOfMV4moYkwKSEb6zwyPBySLXhl2Z1NjeIxGJKv_hVm2uWax5Ins2wFrCGh7Y1-jGe3fAYM2quYDn2SnmbYBlAmQFb2AD9jz0OUuQ90mUW4xY1uAOHO3x-zSzY74u-R9eq-Nh_B3qzyT45IvwFmGHoD
linkProvider EBSCOhost
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=Timed+Automata+as+a+Formalism+for+Expressing+Security%3A+A+Survey+on+Theory+and+Practice&rft.jtitle=ACM+computing+surveys&rft.au=Arcile%2C+Johan&rft.au=Andr%C3%A9%2C+%C3%89tienne&rft.date=2023-07-31&rft.issn=0360-0300&rft.eissn=1557-7341&rft.volume=55&rft.issue=6&rft.spage=1&rft.epage=36&rft_id=info:doi/10.1145%2F3534967&rft.externalDBID=n%2Fa&rft.externalDocID=10_1145_3534967
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-0300&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-0300&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-0300&client=summon