MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Charatonik, Witold
McAllester, David
Niwinski, Damian
Podelski, Andreas
Walukiewicz, Igor		dblp
dblp
dblp
dblp
dblp
Editor(s):
Pratt, Vaughandblp
BibTeX cite key*:
CharatonikMNPW-LICS98
Title, Booktitle
Title*:
The Horn Mu-calculus
Booktitle*:
Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Indianapolis, Indiana
Language:
English
Event Date*
(no longer used):
June 21-24
Organization:
IEEE Technical Committee on Mathematical Foundations of Computing
Event Start Date:
8 July 2003
Event End Date:
12 July 2003
Publisher
Name*:
IEEE
URL:
Address*:
Los Alamitos, USA
Type:
Extended Abstract
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
June
Pages:
58-69
Year*:
1998
VG Wort Pages:
ISBN/ISSN:
0-8186-8506-9
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
 The Horn $\mu$-calculus is a logic programming language allowing
arbitrary nesting of least and greatest fixed points. The Horn
$\mu$-programs can naturally expresses safety and liveness
properties for reactive systems. We extend the set-based analysis
of classical logic programs by mapping arbitrary $\mu$-programs into
``uniform'' $\mu$-programs. Our two main results are that uniform
$\mu$-programs express regular sets of trees and that emptiness for
uniform $\mu$-programs is EXPTIME-complete. Hence we have a
nontrivial decidable relaxation for the Horn $\mu$-calculus. In a
different reading, the results express a kind of robustness of the
notion of regularity: alternating Rabin tree automata preserve the
same expressiveness and algorithmic complexity if we extend them
with pushdown transition rules (in the same way B\"uchi extended
word automata to canonical systems).
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography



BibTeX Entry:
@INPROCEEDINGS{CharatonikMNPW-LICS98,
AUTHOR = {Charatonik, Witold and McAllester, David and Niwinski, Damian and Podelski, Andreas and Walukiewicz, Igor},
 EDITOR = {Pratt, Vaughan},
 TITLE = {The {H}orn Mu-calculus},
 BOOKTITLE = {Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98)},
 PUBLISHER = {IEEE},
 YEAR = {1998},
 TYPE = {Extended Abstract},
 ORGANIZATION = {IEEE Technical Committee on Mathematical Foundations of Computing},
 PAGES = {58--69},
 ADDRESS = {Indianapolis, Indiana},
 MONTH = {June},
 ISBN = {0-8186-8506-9},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Witold Charatonik		Created
01/13/1999 06:59:39 PM
Revisions
5.
4.
3.
2.
1.		Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Uwe Brahm
Uwe Brahm		Edit Dates
08.07.2003 15:32:15
14.09.2001 03:30:57 PM
28.08.2001 16:32:01
29.03.99 19:26:44
29.03.99 19:22:56