Efficient reduction of nondeterministic automata with application to language inclusion testing

We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalen...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 15, Issue 1
Main Authors: Clemente, Lorenzo, Mayr, Richard
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science e.V 01.01.2019
Subjects:
computer science - formal languages and automata theory
computer science - logic in computer science
d.2.4
f.1.1
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible ($\ge 1000$ states instead of 10-100). This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithms are based on new techniques for removing transitions (pruning) and adding transitions (saturation), as well as extensions of classic quotienting of the state space. These techniques use criteria based on combinations of backward and forward trace inclusions and simulation relations. Since trace inclusion relations are themselves PSPACE-complete, we introduce lookahead simulations as good polynomial time computable approximations thereof. Extensive experiments show that the average-case time complexity of our algorithms scales slightly above quadratically. (The space complexity is worst-case quadratic.) The size reduction of the automata depends very much on the class of instances, but our algorithm consistently reduces the size far more than all previous techniques. We tested our algorithms on NBA derived from LTL-formulae, NBA derived from mutual exclusion protocols and many classes of random NBA and NFA, and compared their performance to the well-known automata tool GOAL. Comment: 69 pages. arXiv admin note: text overlap with arXiv:1210.6624
AbstractList We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible ($\ge 1000$ states instead of 10-100). This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithms are based on new techniques for removing transitions (pruning) and adding transitions (saturation), as well as extensions of classic quotienting of the state space. These techniques use criteria based on combinations of backward and forward trace inclusions and simulation relations. Since trace inclusion relations are themselves PSPACE-complete, we introduce lookahead simulations as good polynomial time computable approximations thereof. Extensive experiments show that the average-case time complexity of our algorithms scales slightly above quadratically. (The space complexity is worst-case quadratic.) The size reduction of the automata depends very much on the class of instances, but our algorithm consistently reduces the size far more than all previous techniques. We tested our algorithms on NBA derived from LTL-formulae, NBA derived from mutual exclusion protocols and many classes of random NBA and NFA, and compared their performance to the well-known automata tool GOAL.
We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible ($\ge 1000$ states instead of 10-100). This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithms are based on new techniques for removing transitions (pruning) and adding transitions (saturation), as well as extensions of classic quotienting of the state space. These techniques use criteria based on combinations of backward and forward trace inclusions and simulation relations. Since trace inclusion relations are themselves PSPACE-complete, we introduce lookahead simulations as good polynomial time computable approximations thereof. Extensive experiments show that the average-case time complexity of our algorithms scales slightly above quadratically. (The space complexity is worst-case quadratic.) The size reduction of the automata depends very much on the class of instances, but our algorithm consistently reduces the size far more than all previous techniques. We tested our algorithms on NBA derived from LTL-formulae, NBA derived from mutual exclusion protocols and many classes of random NBA and NFA, and compared their performance to the well-known automata tool GOAL. Comment: 69 pages. arXiv admin note: text overlap with arXiv:1210.6624
Author Mayr, Richard
Clemente, Lorenzo
Author_xml – sequence: 1
  givenname: Lorenzo
  surname: Clemente
  fullname: Clemente, Lorenzo
– sequence: 2
  givenname: Richard
  surname: Mayr
  fullname: Mayr, Richard
BookMark eNp9UMtOwzAQtFCRKKU_wClHOAT8iBOXG6rKQyriAJyttWMHV2lcOY4Qf4-bgoQ4sJdZrXZmd-YUTTrfGYTOCb6irGTiev20fMkJvyA3hF5STBZHaEpEiXO-qIrJr_4Ezft-g1MxRgQtp0iurHXamS5mwdSDjs53mbdZOlGbaMLWda6PTmcwRL-FCNmHi-8Z7Hat0zBuR5-10DUDNCZznW6HfpyaROuaM3Rsoe3N_Btn6O1u9bp8yNfP94_L23WuGa9ibhTjCnOhayW0ggIzYIYyRdSi1FBxVUICEJwXXFeUa6iLWlmhQHFbCcxm6PGgW3vYyF1wWwif0oOT48CHRkJIPlojjVpQW5ZQKKoLUuMkQRUpjSK8IsBY0hIHLR183wdjpXZx9BoDuFYSLMfc5T53SbgkklC5zz1R6R_qzyv_kL4AHEmLaQ
CitedBy_id crossref_primary_10_1007_s10009_025_00801_5
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.23638/LMCS-15(1:12)2019
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_eb92f66a4b2c41d0ab52b16eb1571a33
10_23638_LMCS_15_1_12_2019
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c357t-eb35b058cdb8cba403a3e23b1b96ca75b6aca7a85545c725cad4dbf8bab5f7803
IEDL.DBID DOA
ISICitedReferencesCount 15
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000463358400019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:51:30 EDT 2025
Sat Nov 29 08:06:27 EST 2025
Tue Nov 18 19:37:06 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c357t-eb35b058cdb8cba403a3e23b1b96ca75b6aca7a85545c725cad4dbf8bab5f7803
OpenAccessLink https://doaj.org/article/eb92f66a4b2c41d0ab52b16eb1571a33
ParticipantIDs doaj_primary_oai_doaj_org_article_eb92f66a4b2c41d0ab52b16eb1571a33
crossref_citationtrail_10_23638_LMCS_15_1_12_2019
crossref_primary_10_23638_LMCS_15_1_12_2019
PublicationCentury 2000
PublicationDate 2019-01-01
PublicationDateYYYYMMDD 2019-01-01
PublicationDate_xml – month: 01
  year: 2019
  text: 2019-01-01
  day: 01
PublicationDecade 2010
PublicationTitle Logical methods in computer science
PublicationYear 2019
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.290147
Snippet We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
SubjectTerms computer science - formal languages and automata theory
computer science - logic in computer science
d.2.4
f.1.1
Title Efficient reduction of nondeterministic automata with application to language inclusion testing
URI https://doaj.org/article/eb92f66a4b2c41d0ab52b16eb1571a33
Volume 15, Issue 1
WOSCitedRecordID wos000463358400019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEF5EPHjxLdYXe_CgSOg-stnEm0qLB1sEFXpb9hUplFba1KO_3dlNWnLSi5cElk0Yvp3deWTyDUJXloLZ9kWWOClJINX2CXgZLmGWE1sIXWhXxmYTcjjMR6PipdXqK9SE1fTANXBdbwpWZplODbMpdUQbwQzN4IgRkmoeeT6JLFrBVDyDOQ-Oc_2XDOOgZN3nweNrQsU1vaPshkVqnZYlahH2R8vS30M7jUuI72tR9tGGnx6g3VW7BdzsvkOkepHuAawEngfC1QApnpUYAnjXFLVE1mWsl9UMHFGNQ5IVtz5R42qGVwlKPJ7ayXIRRwPTxvTjCL33e2-PT0nTHyGxXMgqgThYGCJy60xujU4J19wzbqgpMqulMJmGmw6FaMJKJqx2qTNlbgDDUuaEH6NNENGfIOwLsOOwZOB-mNSnOtewlY20JJdOl8R1EF1hpWxDHh56WEwUBBERXxXwVVQoqihTAd8Oul0_81lTZ_w6-yEswXpmoL2OA6AMqlEG9ZcynP7HS87QdhCozrOco81qvvQXaMt-VePF_DLqGVwH370f2KXakQ
linkProvider Directory of Open Access Journals
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=Efficient+reduction+of+nondeterministic+automata+with+application+to+language+inclusion+testing&rft.jtitle=Logical+methods+in+computer+science&rft.au=Lorenzo+Clemente&rft.au=Richard+Mayr&rft.date=2019-01-01&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=15%2C+Issue+1&rft_id=info:doi/10.23638%2FLMCS-15%281%3A12%292019&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_eb92f66a4b2c41d0ab52b16eb1571a33
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon