Abstract
We study the problem of using monadic second order (MSO) logic to reason about certain distributed infinite state systems that communicate by exchanging messages. The success of MONA [6] and similar tools shows that a nonelementary worst-case complexity of MSO logic is not relevant in the practice of model checking. Indeed, MSO logic enjoys a satisfactory expressive power for many applications since it subsumes many temporal and program logics. Towards obtaining decidable MSO theory, we consider systems that are not explicitly product-based but, still have an underlying component-based structure.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
