On the Model Checking of the Graded $$\mu $$ -calculus on Trees

The $$\mu $$ -calculus is an expressive propositional modal logic augmented with least and greatest fixed-points, and encompasses many temporal, program, dynamic and description logics. The model checking problem for the $$\mu $$ -calculus is known to be in NP $$\cap $$ Co-NP. In this paper, we stud...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Artificial Intelligence and Soft Computing pp. 178 - 189
Main Authors Bárcenas, Everardo, Benítez-Guerrero, Edgard, Lavalle, Jesús
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2015
SeriesLecture Notes in Computer Science
Subjects
Accessible Node
Description Logic
Input Tree
Linear Temporal Logic
Model Check
Online AccessGet full text
ISBN9783319270593
3319270591
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-27060-9_14

Cover

Abstract The $$\mu $$ -calculus is an expressive propositional modal logic augmented with least and greatest fixed-points, and encompasses many temporal, program, dynamic and description logics. The model checking problem for the $$\mu $$ -calculus is known to be in NP $$\cap $$ Co-NP. In this paper, we study the model checking problem for the $$\mu $$ -calculus extended with graded modalities. These constructors allow to express numerical constraints on the occurrence of accessible nodes (worlds) satisfying a certain formula. It is known that the model checking problem for the graded $$\mu $$ -calculus with finite models is in EXPTIME. In the current work, we introduce a linear-time model checking algorithm for the graded $$\mu $$ -calculus when models are finite unranked trees.
AbstractList The $$\mu $$ -calculus is an expressive propositional modal logic augmented with least and greatest fixed-points, and encompasses many temporal, program, dynamic and description logics. The model checking problem for the $$\mu $$ -calculus is known to be in NP $$\cap $$ Co-NP. In this paper, we study the model checking problem for the $$\mu $$ -calculus extended with graded modalities. These constructors allow to express numerical constraints on the occurrence of accessible nodes (worlds) satisfying a certain formula. It is known that the model checking problem for the graded $$\mu $$ -calculus with finite models is in EXPTIME. In the current work, we introduce a linear-time model checking algorithm for the graded $$\mu $$ -calculus when models are finite unranked trees.
Author Benítez-Guerrero, Edgard
Lavalle, Jesús
Bárcenas, Everardo
Author_xml – sequence: 1
  givenname: Everardo
  surname: Bárcenas
  fullname: Bárcenas, Everardo
  email: ebarcenaspa@conacyt.mx
  organization: Facultad de Estadística E Informática, Universidad Veracruzana, Xalapa, Mexico
– sequence: 2
  givenname: Edgard
  surname: Benítez-Guerrero
  fullname: Benítez-Guerrero, Edgard
  organization: Facultad de Estadística E Informática, Universidad Veracruzana, Xalapa, Mexico
– sequence: 3
  givenname: Jesús
  surname: Lavalle
  fullname: Lavalle, Jesús
  organization: Instituto Nacional de Astrofísica, Óptica Y Electrónica, Puebla, Mexico
BookMark eNpNkE1PwzAMhgMMiTL6DzjksGvAjtOPnBCaYCAN7TJuSFGbOgxWWtRs_59ucOBiS88rWX6fSzHp-o6FuEa4QYDi1halIkVolS4gB2UdmhORjphGeGT2VCSYIyoiY8_-Z5mliUiAQCtbGLoQaYyfAIBZaUqgRNytOrnbsHzpG27lfMN--9G9yz4c6WKoGm7kbPb2tR-nVL5q_b7dR9l3cj0wxytxHqo2cvq3p-L18WE9f1LL1eJ5fr9UEW25U1XdBMpDVgddg0emQCYgGzI6q3VoApSV1x58UVqjNduGvQes88wEa9DTVOjfu_F7GB_kwdV9v40OwR0subGyIzeWdkcj7mCJfgDyf1Uj
ContentType Book Chapter
Copyright Springer International Publishing Switzerland 2015
Copyright_xml – notice: Springer International Publishing Switzerland 2015
DOI 10.1007/978-3-319-27060-9_14
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 9783319270609
3319270605
EISSN 1611-3349
Editor Sidorov, Grigori
Galicia-Haro, Sofía N.
Editor_xml – sequence: 1
  givenname: Grigori
  surname: Sidorov
  fullname: Sidorov, Grigori
  email: sidorov@cic.ipn.mx
– sequence: 2
  givenname: Sofía N.
  surname: Galicia-Haro
  fullname: Galicia-Haro, Sofía N.
  email: sngh@fciencias.unam.mx
EndPage 189
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s198t-abdf36f5bf2b0c1e3f34f1e43425b2fdf08ac2c0c789422e9decc01b654f941c3
ISBN 9783319270593
3319270591
ISSN 0302-9743
IngestDate Wed Sep 17 03:58:40 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s198t-abdf36f5bf2b0c1e3f34f1e43425b2fdf08ac2c0c789422e9decc01b654f941c3
Notes Original Title: On the Model Checking of the Graded \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}-calculus on Trees
Original Abstract: The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}-calculus is an expressive propositional modal logic augmented with least and greatest fixed-points, and encompasses many temporal, program, dynamic and description logics. The model checking problem for the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}-calculus is known to be in NP \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\cap $$\end{document} Co-NP. In this paper, we study the model checking problem for the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}-calculus extended with graded modalities. These constructors allow to express numerical constraints on the occurrence of accessible nodes (worlds) satisfying a certain formula. It is known that the model checking problem for the graded \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}-calculus with finite models is in EXPTIME. In the current work, we introduce a linear-time model checking algorithm for the graded \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}-calculus when models are finite unranked trees.
PageCount 12
ParticipantIDs springer_books_10_1007_978_3_319_27060_9_14
PublicationCentury 2000
PublicationDate 2015
PublicationDateYYYYMMDD 2015-01-01
PublicationDate_xml – year: 2015
  text: 2015
PublicationDecade 2010
PublicationPlace Cham
PublicationPlace_xml – name: Cham
PublicationSeriesSubtitle Lecture Notes in Artificial Intelligence
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationSubtitle 14th Mexican International Conference on Artificial Intelligence, MICAI 2015, Cuernavaca, Morelos, Mexico, October 25-31, 2015, Proceedings, Part I
PublicationTitle Advances in Artificial Intelligence and Soft Computing
PublicationYear 2015
Publisher Springer International Publishing
Publisher_xml – name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Steffen, Bernhard
Pandu Rangan, C.
Kanade, Takeo
Kittler, Josef
Weikum, Gerhard
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, United Kingdom
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, United Kingdom
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: CNB H 104.2, ETH Zürich, Zürich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology Madr, Chennai, India
– sequence: 9
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: Technical University of Dortmund, Dortmund, Germany
– sequence: 10
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: Los Angeles, USA
– sequence: 11
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 12
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max Planck Institute for Informatic, Saarbrücken, Germany
SSID ssj0001584803
ssj0002792
Score 1.7898988
Snippet The $$\mu $$ -calculus is an expressive propositional modal logic augmented with least and greatest fixed-points, and encompasses many temporal, program,...
SourceID springer
SourceType Publisher
StartPage 178
SubjectTerms Accessible Node
Description Logic
Input Tree
Linear Temporal Logic
Model Check
Title On the Model Checking of the Graded $$\mu $$ -calculus on Trees
URI http://link.springer.com/10.1007/978-3-319-27060-9_14
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LbxMxELZCuEAPQAFRXvIht2jRetf7OiAUQmhVVe0lRT0grdZeu0jQXWkfPfRX8ROZsb3JNu2lSJG1spzEmc-ZGc-TkJlI4xQEufZUgdYqFmtPxEJ4LCliBepGkQlT7fM0PjrnxxfRxWTydxS11Hfik7y5N6_kf1CFOcAVs2QfgOzmQ2ECngFfGAFhGHeU39tmVhtebL33Jp510ZiQH1s4Y1Rj08Zl6m5umzcMYgqv38ZDzhqpKpvStbrGVOSy3iwAfoRLvnXqxjvsVdMomxKzKi9dJr4t2HiN3VhsoEyL7_i6aMfn8MzGUWLPtT_z5S8lf7s4a5w9bIpSoRmD4ytaXvXuee7B2UHLpPFmrBvlQh2RrKr9fOI8H6d1ZwkwNKcYeNXYmMGiHWPGYMzcMYduLXK3br8hsI8gwZ6EI6YZAoeHO5KdUpapx1iqMbSlUR2jZrZxkJP5zLYxuiNOxhEkmO0VYK0hL8uxc_oj2MCUPF6sjk9-bK16oM-Zdl9OF8DyjNaPZXeF2UXDrpmt_7T9FaPMzvu-8o6v3qhA6-dkD9NiKOarANFekImq9smzge7U0X2fPB1VuHxJvpxVFICmBn46wE9rbWYt_HQ2-3nVw0g3oNO6ogb0V-T8-2q9PPJczw6vZVnaeYUodRjrSOhA-JKpUIdcM8VDkA0i0KX200IG0pdJmvEgUFkJPMRnIo64zjiT4WsyrepKvSE0y3ioBZNSiJLrRAoFulTAVRb4CXAWdUDmAz1y_Be2-VCCG6iXhzlQLzfUy5F6bx-0-h15sj2e78m0a3r1AbTPTnx0kP8D8Hp2gg
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Advances+in+Artificial+Intelligence+and+Soft+Computing&rft.au=B%C3%A1rcenas%2C+Everardo&rft.au=Ben%C3%ADtez-Guerrero%2C+Edgard&rft.au=Lavalle%2C+Jes%C3%BAs&rft.atitle=On+the+Model+Checking+of+the+Graded+%24%24%5Cmu+%24%24+-calculus+on+Trees&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2015-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319270593&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=178&rft.epage=189&rft_id=info:doi/10.1007%2F978-3-319-27060-9_14
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon