liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Model Checking by Random Walk
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
1999 (English)In: Proceedings of the ECSEL Workshop (CCSSE), 1999Conference paper, Published paper (Other academic)
Abstract [en]

While model checking algorithms are in theory efficient, they are in practice hampered by the explosive growth of system models. We show that for certain specifications the model cheking problem reduces to a question of reachability in the system state transition graph, and apply a simple, randomized algorithm to this problem.

Place, publisher, year, edition, pages
1999.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-59902OAI: oai:DiVA.org:liu-59902DiVA, id: diva2:354005
Available from: 2010-09-29 Created: 2010-09-29 Last updated: 2018-01-12

Open Access in DiVA

No full text in DiVA

Authority records

Haslum, Patrik

Search in DiVA

By author/editor
Haslum, Patrik
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 1026 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf