Distributed Explicit Bounded LTL Model Checking

Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method  model checking  is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this probl...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science Vol. 89; no. 1; pp. 33 - 50
Main Author: Krčál, Pavel
Format: Journal Article
Language:English
Published: Elsevier B.V 01.09.2003
ISSN:1571-0661, 1571-0661
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method  model checking  is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this problem by applying the idea of bounding the examined state space in explicit model checking. Moreover, we combine this approach with the distribution of the computation among the network of workstations. We consider several distributed bounded LTL model checking algorithms and carry out a series of experiments to evaluate them and to compare their behaviour.
AbstractList Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method  model checking  is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this problem by applying the idea of bounding the examined state space in explicit model checking. Moreover, we combine this approach with the distribution of the computation among the network of workstations. We consider several distributed bounded LTL model checking algorithms and carry out a series of experiments to evaluate them and to compare their behaviour.
Author Krčál, Pavel
Author_xml – sequence: 1
  givenname: Pavel
  surname: Krčál
  fullname: Krčál, Pavel
  email: xkrcal@fi.muni.cz
  organization: Faculty of Informatics, Masaryk University Brno, Czech Republic
BookMark eNqFj0tLAzEUhYNUsK3-BGGWuhh7M5m8cCHa1geMuLCuQybJaHScKclU9N87bUXETVf3cOA73G-EBk3bOISOMZxhwGzyiCnHKTCGT4CeCgBJU76Hhr_14E8-QKMYXwGIwJwN0WTmYxd8ueqcTeafy9ob3yVX7aqxfVEsiuS-ta5Opi_OvPnm-RDtV7qO7ujnjtHT9XwxvU2Lh5u76WWRmoxjnuo8d2XOS8toBhiyigsic5PJUlTSaqlJLoGwipFKEG6zUmppBeUCA7UWEzJG59tdE9oYg6tU_5fufNt0QftaYVBrd7VxV2sxBVRt3BXvafqPXgb_rsPXTu5iy7le7cO7oKLxrjHO-uBMp2zrdyx8A7M3cQU
CitedBy_id crossref_primary_10_1007_s10703_006_0008_z
crossref_primary_10_1007_s10703_006_0012_3
crossref_primary_10_1007_s10009_008_0070_5
Cites_doi 10.1007/BF01782776
10.1016/0020-0190(85)90024-9
10.1016/0890-5401(92)90017-A
ContentType Journal Article
Copyright 2003 Elsevier B.V.
Copyright_xml – notice: 2003 Elsevier B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/S1571-0661(05)80095-7
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0661
EndPage 50
ExternalDocumentID 10_1016_S1571_0661_05_80095_7
S1571066105800957
GroupedDBID --K
--M
0R~
1B1
1~5
29G
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIKJ
AAKOC
AALRI
AAQFI
AAQXK
AAXUO
ABFNM
ABMAC
ABWVN
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACRPL
ACXMD
ADBBV
ADEZE
ADFGL
ADMUD
ADNMO
ADVLN
AEIPS
AEKER
AEXQZ
AFTJW
AFXIZ
AGHFR
AGQPQ
AIEXJ
AIKHN
AITUG
AJMQA
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BNPGV
CS3
DU5
EBS
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FNPLU
G-Q
GBLVA
HVGLF
HZ~
IHE
IXB
J1W
KOM
KQ8
M41
M~E
N9A
O-L
O9-
OK1
OZT
P2P
R2-
RIG
ROL
RPZ
SDG
SES
SEW
SPC
SSH
SSV
SSW
SSZ
9DU
AAYWO
AAYXX
ACLOT
ACVFH
ADCNI
AEUPX
AFPUW
AIGII
AKBMS
AKYEP
CITATION
~HD
ID FETCH-LOGICAL-c2717-a44eb47bd6520102f78394c29b8f9da9a349036f63f837d2b9a9d8578105dd133
ISSN 1571-0661
IngestDate Tue Nov 18 21:28:53 EST 2025
Sat Nov 29 02:21:52 EST 2025
Thu Apr 10 08:06:46 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 1
Language English
License http://creativecommons.org/licenses/by-nc-nd/3.0
https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c2717-a44eb47bd6520102f78394c29b8f9da9a349036f63f837d2b9a9d8578105dd133
OpenAccessLink https://dx.doi.org/10.1016/S1571-0661(05)80095-7
PageCount 18
ParticipantIDs crossref_citationtrail_10_1016_S1571_0661_05_80095_7
crossref_primary_10_1016_S1571_0661_05_80095_7
elsevier_sciencedirect_doi_10_1016_S1571_0661_05_80095_7
PublicationCentury 2000
PublicationDate September 2003
2003-09-00
PublicationDateYYYYMMDD 2003-09-01
PublicationDate_xml – month: 09
  year: 2003
  text: September 2003
PublicationDecade 2000
PublicationTitle Electronic notes in theoretical computer science
PublicationYear 2003
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Vardi, Wolper (BIB18) 1986
Brim, Crhová, Yorav (BIB6) 2002; volume 68
Mattern (BIB15) 1987; 2, 3
Biere, Cimatti, Clarke, Zhu (BIB3) 1999
Clarke, Grumberg, Peled (BIB9) 1999
Burch, Clarke, McMillan, Dill, Hwang (BIB7) June 1992; 98
Bollig, Leucker, Weber (BIB4) 2002
Černá, Pelánek (BIB8) 2003
Barnat, Brim, Stříbrná (BIB1) 2001
Barnat, Brim, Černá (BIB2) 2002
Krčál (BIB13) 2003
Holzmann (BIB11) 1997; 23
Tel (BIB17) 1994
Brim, Černá, Krčál, Pelánek (BIB5) 2001
Lowry (BIB14) 2002
Reif (BIB16) 1985; 20
Garavel, Mateescu, Smarandache (BIB10) 2001; 2057
Kesten, Pnueli, Raviv (BIB12) 1998
Garavel (10.1016/S1571-0661(05)80095-7_BIB10) 2001; 2057
Brim (10.1016/S1571-0661(05)80095-7_BIB6) 2002; volume 68
Barnat (10.1016/S1571-0661(05)80095-7_BIB1) 2001
Bollig (10.1016/S1571-0661(05)80095-7_BIB4) 2002
Burch (10.1016/S1571-0661(05)80095-7_BIB7) 1992; 98
Kesten (10.1016/S1571-0661(05)80095-7_BIB12) 1998
Biere (10.1016/S1571-0661(05)80095-7_BIB3) 1999
Reif (10.1016/S1571-0661(05)80095-7_BIB16) 1985; 20
Holzmann (10.1016/S1571-0661(05)80095-7_BIB11) 1997; 23
Černá (10.1016/S1571-0661(05)80095-7_BIB8) 2003
Tel (10.1016/S1571-0661(05)80095-7_BIB17) 1994
Krčál (10.1016/S1571-0661(05)80095-7_BIB13) 2003
Vardi (10.1016/S1571-0661(05)80095-7_BIB18) 1986
Barnat (10.1016/S1571-0661(05)80095-7_BIB2) 2002
Brim (10.1016/S1571-0661(05)80095-7_BIB5) 2001
Lowry (10.1016/S1571-0661(05)80095-7_BIB14) 2002
Mattern (10.1016/S1571-0661(05)80095-7_BIB15) 1987; 2, 3
Clarke (10.1016/S1571-0661(05)80095-7_BIB9) 1999
References_xml – volume: 2, 3
  start-page: 161
  year: 1987
  end-page: 175
  ident: BIB15
  article-title: Algorithms for distributed termination detection
  publication-title: Distributed Computing
– volume: 20
  start-page: 229
  year: 1985
  end-page: 234
  ident: BIB16
  article-title: Depth-first search is inherrently sequential
  publication-title: Information Processing Letters
– start-page: 193
  year: 1999
  end-page: 207
  ident: BIB3
  article-title: Symbolic model checking without BDDs
  publication-title: Tools
– year: 2003
  ident: BIB13
  article-title: Distributed explicit bounded LTL model checking
  publication-title: Master's thesis, Masaryk University Brno
– volume: volume 68
  year: 2002
  ident: BIB6
  article-title: Using assumptions to distribute CTL model checking
  publication-title: Electronic Notes in Theoretical Computer Science
– volume: 2057
  start-page: 200
  year: 2001
  end-page: 216
  ident: BIB10
  article-title: Parallel state space construction for model-checking
  publication-title: Lecture Notes in Computer Science
– year: 1999
  ident: BIB9
  publication-title: Model Checking
– start-page: 96
  year: 2001
  end-page: 107
  ident: BIB5
  article-title: Distributed LTL model checking based on negative cycle detection
  publication-title: , volume 2245 of LNCS
– year: 2002
  ident: BIB4
  article-title: Local parallel model checking for the alternation-free mu-calculus
  publication-title: SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of LNCS
– volume: 23
  start-page: 279
  year: 1997
  end-page: 295
  ident: BIB11
  article-title: The model checker SPIN., IEEE Transactions on Software
  publication-title: Engineering
– year: 1998
  ident: BIB12
  article-title: Algorithmic verification of linear temporal logic specifications
  publication-title: ICALP: Annual International Colloquium on Automata, Languages and Programming
– start-page: 200
  year: 2001
  end-page: 216
  ident: BIB1
  article-title: Distributed LTL Model-Checking in SPIN
  publication-title: , volume 2057 of LNCS
– start-page: 1
  year: 2002
  end-page: 19
  ident: BIB14
  article-title: Software construction and analysis tools for future space missions
  publication-title: , volume 2280 of LNCS
– year: 2003
  ident: BIB8
  article-title: Distributed explicit fair cycle detection
  publication-title: , number 2648 in LNCS
– start-page: 1
  year: 2002
  end-page: 10
  ident: BIB2
  article-title: Property driven distribution of Nested DFS
  publication-title: , number DSSE- TR-2002-5 in DSSE Technical Report
– year: 1994
  ident: BIB17
  publication-title: Introduction to Distibuted Algorithms
– volume: 98
  start-page: 142
  year: June 1992
  end-page: 170
  ident: BIB7
  article-title: Symbolic model checking: 10
  publication-title: Information and Computation
– start-page: 332
  year: 1986
  end-page: 344
  ident: BIB18
  article-title: An automata-theoretic approach to automatic program verification
  publication-title: Proc. LICS 1986
– year: 2002
  ident: 10.1016/S1571-0661(05)80095-7_BIB4
  article-title: Local parallel model checking for the alternation-free mu-calculus
– year: 1999
  ident: 10.1016/S1571-0661(05)80095-7_BIB9
– start-page: 193
  year: 1999
  ident: 10.1016/S1571-0661(05)80095-7_BIB3
  article-title: Symbolic model checking without BDDs
– start-page: 200
  year: 2001
  ident: 10.1016/S1571-0661(05)80095-7_BIB1
  article-title: Distributed LTL Model-Checking in SPIN
– volume: 2, 3
  start-page: 161
  year: 1987
  ident: 10.1016/S1571-0661(05)80095-7_BIB15
  article-title: Algorithms for distributed termination detection
  publication-title: Distributed Computing
  doi: 10.1007/BF01782776
– start-page: 96
  year: 2001
  ident: 10.1016/S1571-0661(05)80095-7_BIB5
  article-title: Distributed LTL model checking based on negative cycle detection
– start-page: 1
  year: 2002
  ident: 10.1016/S1571-0661(05)80095-7_BIB2
  article-title: Property driven distribution of Nested DFS
– volume: 2057
  start-page: 200
  year: 2001
  ident: 10.1016/S1571-0661(05)80095-7_BIB10
  article-title: Parallel state space construction for model-checking
  publication-title: Lecture Notes in Computer Science
– start-page: 1
  year: 2002
  ident: 10.1016/S1571-0661(05)80095-7_BIB14
  article-title: Software construction and analysis tools for future space missions
– volume: 20
  start-page: 229
  issue: 5
  year: 1985
  ident: 10.1016/S1571-0661(05)80095-7_BIB16
  article-title: Depth-first search is inherrently sequential
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(85)90024-9
– year: 2003
  ident: 10.1016/S1571-0661(05)80095-7_BIB13
  article-title: Distributed explicit bounded LTL model checking
  publication-title: Master's thesis, Masaryk University Brno
– volume: volume 68
  year: 2002
  ident: 10.1016/S1571-0661(05)80095-7_BIB6
  article-title: Using assumptions to distribute CTL model checking
– year: 1998
  ident: 10.1016/S1571-0661(05)80095-7_BIB12
  article-title: Algorithmic verification of linear temporal logic specifications
– year: 1994
  ident: 10.1016/S1571-0661(05)80095-7_BIB17
– volume: 23
  start-page: 279
  issue: 5
  year: 1997
  ident: 10.1016/S1571-0661(05)80095-7_BIB11
  article-title: The model checker SPIN., IEEE Transactions on Software
  publication-title: Engineering
– start-page: 332
  year: 1986
  ident: 10.1016/S1571-0661(05)80095-7_BIB18
  article-title: An automata-theoretic approach to automatic program verification
– year: 2003
  ident: 10.1016/S1571-0661(05)80095-7_BIB8
  article-title: Distributed explicit fair cycle detection
– volume: 98
  start-page: 142
  issue: 2
  year: 1992
  ident: 10.1016/S1571-0661(05)80095-7_BIB7
  article-title: Symbolic model checking: 1020 states and beyond
  publication-title: Information and Computation
  doi: 10.1016/0890-5401(92)90017-A
SSID ssj0038176
Score 1.3829076
Snippet Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method  model checking  is strongly...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 33
Title Distributed Explicit Bounded LTL Model Checking
URI https://dx.doi.org/10.1016/S1571-0661(05)80095-7
Volume 89
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1571-0661
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0038176
  issn: 1571-0661
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEA66evDiW3zTg4KyVLdtukmO6wsVEcEV9lbSJMVFqbKusj_fyav1hY-Dl7IEMu12vs58TSfzIbTFmVA5lkkoE4FDDAkj1F3Cw6KdKK6UwowWRmyCXF7SXo9duSL2JyMnQMqSjkbs8V9dDWPgbL119g_urozCAPwGp8MR3A7HXzn-SLfC1SpWQCV1hV1f9IfNA62eBAMX3Qsjf3bfPLxV4s7nLb80X2vilA9DU6r1bqejcBIQTZc3q2g9MJz0yHx1j6woMn9xxfh-SSGpaqaqKEh0OZTtkr6nvhhzodOq_7yDiI2DtrmFy6i2s-ynWG2XDa4rw8CoW-l2zKimfSGpE5T_KP8hb1XVhFWhmjaVaVNZK82MmYyMo4mYpIw20ETn7Lh37tO07kxotp7509fbu_bra9pppbvuer4mLm_ISHcWTbu3iKBjvT-HxlQ5j2a8QkfgAvYC2n8DhsCDIXBgCAAMgQFD4MGwiG5OjruHp6GTyAhFDC_iIccYHjWSy3aqyxriggDhxSJmOS2Y5IwnmAFHgSevoAmRcc44kxSiNNBqKaMkWUKN8qFUyyjIozyKJSWqhSXOI84L3C4UExHFugecWkHY__9MuP7xWsbkPvv2_q-gvWrao22g8tME6m9u5tBs2V0GwPl-6upfz7WGpmr8r6PGcPCsNtCkeBn2nwabDjGvg1dx-w
linkProvider Elsevier
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=Distributed+Explicit+Bounded+LTL+Model+Checking&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Kr%C4%8D%C3%A1l%2C+Pavel&rft.date=2003-09-01&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=89&rft.issue=1&rft.spage=33&rft.epage=50&rft_id=info:doi/10.1016%2FS1571-0661%2805%2980095-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S1571_0661_05_80095_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon