Mu-calculus satisfiability with arithmetic constraints

DOI10.1134/S0361768820080137MaRDI QIDQ2226964zbMATH OpenOpenAlexFDO

Authors Y. Limón, Everardo Bárcenas, G. Molero Castillo, Alejandro Velázquez-Mena, Edgard Benítez-Guerrero

Publication date 9 February 2021

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0361768820080137

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Efficiently deciding -calculus with converse over finite trees
• Modal μ-Calculus and Alternating Tree Automata
• On model checking for the -calculus and its fragments
• Local model checking in the modal mu-calculus
• Automata for the modal -calculus and related results

Cites work

• Algorithmic correspondence for intuitionistic modal mu-calculus
• Complexity of modal logics with Presburger constraints
• Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
• Global numerical constraints on trees
• The Complexity of Enriched Mu-Calculi
• XML applications development in scheme

Cited in

(6)

• Optimal satisfiability checking for arithmetic \(\mu\)-calculi
• Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
• Efficiently deciding -calculus with converse over finite trees
• Canonicity results for mu-calculi: an algorithmic approach
• Decidability and undecidability results on the modal -calculus with a natural number-valued semantics
• scientific article; zbMATH DE number 1406235 (Why is no real title available?)

This page was built for publication: Mu-calculus satisfiability with arithmetic constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226964)