Domain mu-calculus

DOI10.1051/ITA:2003023MaRDI QIDQ4460689zbMATH OpenOpenAlexFDO

Authors

Publication date 29 March 2004

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2003__37_4_337_0, https://eudml.org/doc/92727

zbMATH Keywords

decidabilitylanguage equationsexpressive powerdomain \(\mu\)-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• Results on the propositional \(\mu\)-calculus
• Rudiments of \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• Automata for the modal -calculus and related results
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties

Cites work

• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3787631 (Why is no real title available?)
• scientific article; zbMATH DE number 1318043 (Why is no real title available?)
• scientific article; zbMATH DE number 730303 (Why is no real title available?)
• scientific article; zbMATH DE number 1136070 (Why is no real title available?)
• scientific article; zbMATH DE number 1142322 (Why is no real title available?)
• scientific article; zbMATH DE number 1948516 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• μ-definable sets of integers
• A Powerdomain Construction
• A completeness theorem for Kleene algebras and the algebra of regular events
• A domain equation for bisimulation
• Alternation
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Completeness of Park induction
• Constructions for alternating finite automata^∗
• Domain theory in logical form
• Equational axioms for regular sets
• Fixed point characterization of infinite behavior of finite-state systems
• Generalizations of regular events
• On a family of linear grammars
• On equations for regular languages, finite automata, and sequential networks
• On the closure properties of linear conjunctive languages.
• On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
• Results on the propositional \(\mu\)-calculus
• Succinct representation of regular languages by Boolean automata
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Toward an infinitary logic of domains: Abramsky logic for transition systems

Cited in

(4)

• Unresolved systems of language equations: expressive power and decision problems
• Decision problems for language equations
• scientific article; zbMATH DE number 4213958 (Why is no real title available?)
• scientific article; zbMATH DE number 7357543 (Why is no real title available?)

This page was built for publication: Domain mu-calculus

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