Sciweavers

305 search results - page 9 / 61
» Decidability of Split Equivalence
Sort
View
FSTTCS
2004
Springer
14 years 1 months ago
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Angelo Montanari, Gabriele Puppis
HYBRID
2003
Springer
14 years 26 days ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
DKE
2007
136views more  DKE 2007»
13 years 7 months ago
Deciding XPath containment with MSO
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...
Pierre Genevès, Nabil Layaïda
DAGSTUHL
2007
13 years 9 months ago
Model equivalence of PRISM programs
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
James Cussens
TACS
2001
Springer
14 years 2 days ago
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
Ph. Schnoebelen