Local computation of alternating fixed-points:
Abstract: "In this paper we consider the problem of computing alternating fixed-points of monotone functions on finite boolean lattices. We describe a local (demand-driven, lazy) algorithm for computing a boolean expression with two alternating fixed-points, i.e. with a minimal and a maximal fi...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1992
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
260 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we consider the problem of computing alternating fixed-points of monotone functions on finite boolean lattices. We describe a local (demand-driven, lazy) algorithm for computing a boolean expression with two alternating fixed-points, i.e. with a minimal and a maximal fixed-point intertwined. Such expressions arise naturally in the modal [mu]-calculus and is the main source to its expressive power -- and its difficult model checking problem By a translation of the model checking problem of the modal [mu]- calculus into a problem of finding fixed-points on boolean lattices, we get a local model checker for two alternating fixed-points which runs in time O([abs A]([abs T] p2 s)log([abs A][abs t])), where [abs A] is the size of the assertion and [abs T] the size of the model, a labelled transition system. This extends earlier results by the author and improves on earlier published local algorithms. We also sketch how the algorithm can be extended to arbitrary alternations. Due to the generality of the algorithm it can be applied to other (alternating or non-alternating) fixed-point problems. |
| Beschreibung: | 21 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010411834 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951006s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)29515676 | ||
| 035 | |a (DE-599)BVBBV010411834 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Andersen, Henrik R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Local computation of alternating fixed-points |c by Henrik Reif Andersen |
| 264 | 1 | |a Cambridge |c 1992 | |
| 300 | |a 21 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 260 | |
| 520 | 3 | |a Abstract: "In this paper we consider the problem of computing alternating fixed-points of monotone functions on finite boolean lattices. We describe a local (demand-driven, lazy) algorithm for computing a boolean expression with two alternating fixed-points, i.e. with a minimal and a maximal fixed-point intertwined. Such expressions arise naturally in the modal [mu]-calculus and is the main source to its expressive power -- and its difficult model checking problem | |
| 520 | 3 | |a By a translation of the model checking problem of the modal [mu]- calculus into a problem of finding fixed-points on boolean lattices, we get a local model checker for two alternating fixed-points which runs in time O([abs A]([abs T] p2 s)log([abs A][abs t])), where [abs A] is the size of the assertion and [abs T] the size of the model, a labelled transition system. This extends earlier results by the author and improves on earlier published local algorithms. We also sketch how the algorithm can be extended to arbitrary alternations. Due to the generality of the algorithm it can be applied to other (alternating or non-alternating) fixed-point problems. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Proof theory | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 260 |w (DE-604)BV004055605 |9 260 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006933745 | ||
Datensatz im Suchindex
| _version_ | 1804124840273117184 |
|---|---|
| any_adam_object | |
| author | Andersen, Henrik R. |
| author_facet | Andersen, Henrik R. |
| author_role | aut |
| author_sort | Andersen, Henrik R. |
| author_variant | h r a hr hra |
| building | Verbundindex |
| bvnumber | BV010411834 |
| ctrlnum | (OCoLC)29515676 (DE-599)BVBBV010411834 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02029nam a2200301 cb4500</leader><controlfield tag="001">BV010411834</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29515676</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411834</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andersen, Henrik R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Local computation of alternating fixed-points</subfield><subfield code="c">by Henrik Reif Andersen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">260</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we consider the problem of computing alternating fixed-points of monotone functions on finite boolean lattices. We describe a local (demand-driven, lazy) algorithm for computing a boolean expression with two alternating fixed-points, i.e. with a minimal and a maximal fixed-point intertwined. Such expressions arise naturally in the modal [mu]-calculus and is the main source to its expressive power -- and its difficult model checking problem</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">By a translation of the model checking problem of the modal [mu]- calculus into a problem of finding fixed-points on boolean lattices, we get a local model checker for two alternating fixed-points which runs in time O([abs A]([abs T] p2 s)log([abs A][abs t])), where [abs A] is the size of the assertion and [abs T] the size of the model, a labelled transition system. This extends earlier results by the author and improves on earlier published local algorithms. We also sketch how the algorithm can be extended to arbitrary alternations. Due to the generality of the algorithm it can be applied to other (alternating or non-alternating) fixed-point problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">260</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">260</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933745</subfield></datafield></record></collection> |
| id | DE-604.BV010411834 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:03Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933745 |
| oclc_num | 29515676 |
| open_access_boolean | |
| physical | 21 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Andersen, Henrik R. Verfasser aut Local computation of alternating fixed-points by Henrik Reif Andersen Cambridge 1992 21 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 260 Abstract: "In this paper we consider the problem of computing alternating fixed-points of monotone functions on finite boolean lattices. We describe a local (demand-driven, lazy) algorithm for computing a boolean expression with two alternating fixed-points, i.e. with a minimal and a maximal fixed-point intertwined. Such expressions arise naturally in the modal [mu]-calculus and is the main source to its expressive power -- and its difficult model checking problem By a translation of the model checking problem of the modal [mu]- calculus into a problem of finding fixed-points on boolean lattices, we get a local model checker for two alternating fixed-points which runs in time O([abs A]([abs T] p2 s)log([abs A][abs t])), where [abs A] is the size of the assertion and [abs T] the size of the model, a labelled transition system. This extends earlier results by the author and improves on earlier published local algorithms. We also sketch how the algorithm can be extended to arbitrary alternations. Due to the generality of the algorithm it can be applied to other (alternating or non-alternating) fixed-point problems. Computer software sigle Proof theory Computer Laboratory <Cambridge>: Technical report 260 (DE-604)BV004055605 260 |
| spellingShingle | Andersen, Henrik R. Local computation of alternating fixed-points Computer Laboratory <Cambridge>: Technical report Computer software sigle Proof theory |
| title | Local computation of alternating fixed-points |
| title_auth | Local computation of alternating fixed-points |
| title_exact_search | Local computation of alternating fixed-points |
| title_full | Local computation of alternating fixed-points by Henrik Reif Andersen |
| title_fullStr | Local computation of alternating fixed-points by Henrik Reif Andersen |
| title_full_unstemmed | Local computation of alternating fixed-points by Henrik Reif Andersen |
| title_short | Local computation of alternating fixed-points |
| title_sort | local computation of alternating fixed points |
| topic | Computer software sigle Proof theory |
| topic_facet | Computer software Proof theory |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT andersenhenrikr localcomputationofalternatingfixedpoints |