744 search results - page 49 / 149 » Observations on the Decidability of Transitions |
CSFW
2007
IEEE
14 years 3 months ago
2007
IEEE
Collaboration among organizations or individuals is common. While these participants are often unwilling to share all their information with each other, some information sharing i...
LPNMR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
TACAS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
CSL
2003
Springer
14 years 2 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...