Recurrent Reachability Analysis in Regular Model Checking

DOI10.1007/978-3-540-89439-1_15zbMath1182.68125OpenAlexW1799164503MaRDI QIDQ5505554

Anthony Widjaja To, Leonid O. Libkin

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17832717/Widjaja_To_Lobkin_2008_Recurrent_Reachability_Analysis_in_Regular_Model_Checking.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Unnamed Item ⋮ Tree-Automatic Well-Founded Trees ⋮ Model Checking FO(R) over One-Counter Processes and beyond

This page was built for publication: Recurrent Reachability Analysis in Regular Model Checking