排序方式: 共有53条查询结果,搜索用时 9 毫秒
1.
Tony Tan 《Journal of Computer and System Sciences》2010,76(8):778-791
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is performed only between the data values seen by the two most recently placed pebbles. The emptiness problem for this model is still decidable. It is also robust: alternating, non-deterministic and deterministic top view weak PA have the same recognition power; and are strong enough to accept all data languages expressible in Linear Temporal Logic with the future-time operators, augmented with one register freeze quantifier. 相似文献
2.
We investigate families of finite initial segments of standard models for various arithmetics. We give an axiomatization of the theory of sentences true in almost all finite models with addition. We also characterize its complete extensions and relate its infinite models to models of Presburger arithmetic.We also estimate the complexity of complete extensions of the arithmetic with addition and multiplication. 相似文献
3.
L. Di Lascio 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2001,5(6):434-439
In this paper Beth–Smullyan's tableaux method is extended to the fuzzy propositional logic. The fuzzy tableaux method is
based on the concepts of t-truth and extended graded formula. As in classical logic, it is a refutation procedure. A closed
fuzzy tableau beginning with the extended graded formula [r, A] asserting that this is not t-true, is a tableau proof of the
graded formula (A, r). The theorems of soundness, completeness, and decidability are proved. 相似文献
4.
Vesa Halava Tero Harju Juhani Karhumki Michel Latteux 《Theoretical computer science》2007,380(3):355-362
In the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a nonempty word w such that h(w)=g(w). Here we prove that the PCP is decidable for instances with unique blocks using the decidability of the marked PCP. Also, we show that it is decidable whether an instance satisfying the uniqueness condition for continuations has an infinite solution. These results establish a new and larger class of decidable instances of the PCP, including the class of marked instances. 相似文献
5.
Caterpillar expressions have been introduced by Brüggemann-Klein and Wood for applications in markup languages. Caterpillar expressions provide a convenient formalism for specifying the operation of tree-walking automata on unranked trees. Here we give a formal definition of determinism of caterpillar expressions that is based on the language of instruction sequences defined by the expression. We show that determinism of caterpillar expressions can be decided in polynomial time. 相似文献
6.
描述了访问控制和逻辑的关系,并将访问控制授权判决问题归约成逻辑蕴涵问题;总结了基于逻辑的访问控制的基本逻辑问题,即逻辑基础、可判定性和安全性分析;分析了一些访问控制模型的基本逻辑问题,包括基于身份的访问控制模型、基于信任管理的访问控制模型和基于属性的访问控制模型;指出了结构化属性描述能力和安全性分析是基于逻辑的访问控制需要进一步研究的问题. 相似文献
7.
Punctual timing constraints are important in formal modelling of safety-critical real-time systems. But they are very expensive to express in dense time. In most cases, punctuality and dense-time lead to undecidability. Efforts have been successful to obtain decidability; but the results are either non-primitive recursive or nonelementary. In this paper we propose a duration logic which can express quantitative temporal constraints and punctuality timing constraints over continuous intervals and has a reasonable complexity. Our logic allows most specifications that are interesting in practice, and retains punctuality. It can capture the semantics of both events and states, and incorporates the notions duration and accumulation. We call this logic ESDL (the acronym stands for Event- and State-based Duration Logic). We show that the satisfiability problem is decidable, and the complexity of the satisfiability problem is NEXPTIME. ESDL is one of a few decidable interval temporal logics with metric operators. Through some case studies, we also show that ESDL can specify many safety-critical real-time system properties which were previously specified by undecidable interval logics or their decidable reductions based on some abstractions. 相似文献
8.
《国际计算机数学杂志》2012,89(3-4):241-248
It is shown to be decidable of any given regular language R and FTOL language L, whether or not R = L 相似文献
9.
The problem of synthesizing a nontrivial controllable and observable sublanguage of a given non-prefix-closed language is
addressed. This problem arises in supervisory control of discrete-event systems, when the objective is to synthesize safe
nonblocking supervisors for partially observed systems. The decentralized version of this problem is known to be unsolvable.
We show that the centralized version of this problem is solvable by presenting a new algorithm that synthesizes a nontrivial
controllable and observable sublanguage of the given non-prefix-closed language, if one exists. We also show that the union
of all nonblocking solutions to the associated supervisory control problem can be expressed as the union of all regular nonblocking
solutions.
This work was done when the first author was at the University of Michigan as a Ph.D. student. 相似文献
10.
Z. Ésik 《Information Processing Letters》2011,111(3):107-109
We prove that there exists no algorithm to decide whether the language generated by a context-free grammar is dense with respect to the lexicographic ordering. As a corollary to this result, we show that it is undecidable whether the lexicographic orderings of the languages generated by two context-free grammars have the same order type. 相似文献