Rabinizer 2: Small deterministic automata for LTL\GU

Jan Křetínský, Ruslán Ledesma Garza

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

17 Scopus citations

Abstract

We present a tool that generates automata for LTL(X,F,G,U) where U does not occur in any G-formula (but F still can). The tool generates deterministic generalized Rabin automata (DGRA) significantly smaller than deterministic Rabin automata (DRA) generated by state-of-the-art tools. For complex properties such as fairness constraints, the difference is in orders of magnitude. DGRA have been recently shown to be as useful in probabilistic model checking as DRA, hence the difference in size directly translates to a speed up of the model checking procedures.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013, Proceedings
Pages446-450
Number of pages5
DOIs
StatePublished - 2013
Event11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013 - Hanoi, Viet Nam
Duration: 15 Oct 201318 Oct 2013

Publication series

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

Conference

Conference11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013
Country/TerritoryViet Nam
CityHanoi
Period15/10/1318/10/13

Fingerprint

Dive into the research topics of 'Rabinizer 2: Small deterministic automata for LTL\GU'. Together they form a unique fingerprint.

Cite this