Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Local Model Checking Algorithm Based on Mu-calculus with Partial Orders
by
Lin, Rongde
, Li, Qianli
, Jiang, Hua
in
Algorithms
/ Complexity
2017
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Local Model Checking Algorithm Based on Mu-calculus with Partial Orders
by
Lin, Rongde
, Li, Qianli
, Jiang, Hua
in
Algorithms
/ Complexity
2017
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Local Model Checking Algorithm Based on Mu-calculus with Partial Orders
Journal Article
Local Model Checking Algorithm Based on Mu-calculus with Partial Orders
2017
Request Book From Autostore
and Choose the Collection Method
Overview
The propositionalμ-calculus can be divided into two categories, global model checking algorithm and local model checking algorithm. Both of them aim at reducing time complexity and space complexity effectively. This paper analyzes the computing process of alternating fixpoint nested in detail and designsan efficient local model checking algorithm based on the propositional μ-calculus by a group of partial ordered relation, and its time complexity is O(d2(dn)d/2+2) (d is the depth of fixpoint nesting, n is the maximum of number of nodes), space complexity is O(d(dn)d/2). As far as we know, up till now, the best local model checking algorithm whose index of time complexity is d. In this paper, the index for time complexity of this algorithm is reduced from d to d/2. It is more efficient than algorithms of previous research.Keywords: model checking, propositional mu-calculus, computational complexity, fixpoint, partitioned dependency graph
Publisher
Ahmad Dahlan University
Subject
This website uses cookies to ensure you get the best experience on our website.