On modal μ-calculus over finite graphs with small components or small tree width
International Journal of Foundations of Computer Science, ISSN: 0129-0541, Vol: 23, Issue: 3, Page: 627-647
2012
- 2Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Captures2
- Readers2
Conference Paper Description
This paper is a continuation and correction of a paper presented by the same authors at the conference GANDALF 2010. We consider the Modal μ-calculus and some fragments of it. For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k, and the class TWk of all finite graphs of tree width at most k. As upper bounds, we show that for every k, the temporal logic CTL* collapses to alternation free μ-calculus in SCCk; and in TW1, the winning condition for parity games of any index n belongs to the level of Modal μ-calculus. As lower bounds, we show that Büchi automata are not closed under complement in TW2 and coBüchi nondeterministic and alternating automata differ in TW1. © 2012 World Scientific Publishing Company.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84861016304&origin=inward; http://dx.doi.org/10.1142/s012905411240031x; http://www.worldscientific.com/doi/abs/10.1142/S012905411240031X; http://www.worldscientific.com/doi/pdf/10.1142/S012905411240031X; https://www.worldscientific.com/doi/abs/10.1142/S012905411240031X; https://www.worldscientific.com/doi/pdf/10.1142/S012905411240031X
World Scientific Pub Co Pte Lt
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know