Continuous Fragment of the mu-Calculus
| Authors | |
|---|---|
| Publication date | 2008 |
| Host editors |
|
| Book title | Computer Science Logic |
| Book subtitle | 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008 : proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | 17th EACSL Annual Conference on Computer Science Logic (CSL 2008), Bertinoro, Italy |
| Pages (from-to) | 139-153 |
| Publisher | Berlin: Springer |
| Organisations |
|
| Abstract | In this paper we investigate the Scott continuous fragment of the modal μ-calculus. We discuss its relation with constructivity, where we call a formula constructive if its least fixpoint is always reached in at most ω steps. Our main result is a syntactic characterization of this continuous fragment. We also show that it is decidable whether a formula is continuous. |
| Document type | Conference contribution |
| Language | English |
| Published at |
https://doi.org/10.1007/978-3-540-87531-4_12
(Final published version)
|
| Permalink to this page | |