{
"item_title" : "Formal Models of Communicating Systems",
"item_author" : [" Benedikt Bollig "],
"item_description" : "This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas's graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/54/032/922/3540329226_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Formal Models of Communicating Systems : Languages, Automata, and Monadic Second-Order Logic
Overview
This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas's graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540329220
- ISBN-10: 3540329226
- Publisher: Springer
- Publish Date: July 2006
- Dimensions: 9.39 x 6.37 x 0.6 inches
- Shipping Weight: 0.9 pounds
- Page Count: 181
Related Categories
