90 search results - page 4 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
ENTCS
2002
13 years 7 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
DKE
2007
13 years 7 months ago
2007
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...