Sciweavers

1650 search results - page 8 / 330
» The HOM problem is decidable
Sort
View
FSTTCS
2004
Springer
14 years 1 months ago
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
Paul Gastin, Benjamin Lerman, Marc Zeitoun
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
GD
2008
Springer
13 years 8 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
JAIR
2011
166views more  JAIR 2011»
13 years 2 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
LICS
2005
IEEE
14 years 1 months ago
On the Decidability of Metric Temporal Logic
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
Joël Ouaknine, James Worrell