Skip to main navigation Skip to search Skip to main content

Rabinizer 3: Safraless translation of ltl to small deterministic automata

  • Masaryk University
  • Institute of Science and Technology Austria (ISTA)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Scopus citations

Abstract

We present a tool for translating LTL formulae into deterministic ω-automata. It is the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants. This leads to smaller automata. There are several outputs of the tool: firstly, deterministic Rabin automata, which are the standard input for probabilistic model checking, e.g. for the probabilistic model-checker PRISM; secondly, deterministic generalized Rabin automata, which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to PRISM and show that this leads to a significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Proceedings
EditorsFranck Cassez, Jean-François Raskin
PublisherSpringer Verlag
Pages235-241
Number of pages7
ISBN (Electronic)9783319119359
DOIs
StatePublished - 2014
Externally publishedYes
Event12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014 - Sydney, Australia
Duration: 3 Nov 20147 Nov 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8837
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014
Country/TerritoryAustralia
CitySydney
Period3/11/147/11/14

Fingerprint

Dive into the research topics of 'Rabinizer 3: Safraless translation of ltl to small deterministic automata'. Together they form a unique fingerprint.

Cite this