The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

Domain mu-calculus

Guo-Qiang Zhang — 2003

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The basic framework of domain μ -calculus was formulated in [39] more than ten years ago. This paper provides an improved formulation of a fragment of the μ -calculus without function space or powerdomain constructions, and studies some open problems related to this μ -calculus such as decidability and expressive power. A class of language equations is introduced for encoding μ -formulas in order to derive results related to decidability and expressive power of non-trivial fragments of the domain μ -calculus....

Domain mu-calculus

Guo-Qiang Zhang — 2010

RAIRO - Theoretical Informatics and Applications

The basic framework of domain -calculus was formulated in [39] more than ten years ago. This paper provides an improved formulation of a fragment of the -calculus without function space or powerdomain constructions, and studies some open problems related to this -calculus such as decidability and expressive power. A class of language equations is introduced for encoding -formulas in order to derive results related to decidability and expressive power of non-trivial fragments of the domain -calculus....

Page 1

Download Results (CSV)