全文获取类型
收费全文 | 112篇 |
免费 | 15篇 |
国内免费 | 16篇 |
专业分类
综合类 | 5篇 |
机械仪表 | 1篇 |
无线电 | 3篇 |
一般工业技术 | 1篇 |
自动化技术 | 133篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 4篇 |
2013年 | 4篇 |
2012年 | 8篇 |
2011年 | 6篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 11篇 |
2006年 | 14篇 |
2005年 | 14篇 |
2004年 | 4篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 2篇 |
排序方式: 共有143条查询结果,搜索用时 15 毫秒
1.
2.
循环术语集是描述逻辑长期以来的研究难点,它的最基本的问题即语义及推理问题没有得到合理的解决。分析了描述逻辑循环术语集的研究现状和存在的问题,基于图的互模拟的方法,给出了描述逻辑FL0循环术语集的可满足性条件。结果证明循环术语集的可满足性的推理是多项式复杂的。 相似文献
3.
In the context of the π-calculus, open bisimulation is prominent and popular due to its congruence properties and its easy implementability. Motivated by the attempt to generalise it to the spi-calculus, we offer a new, more refined definition and show in how far it coincides with the original one. 相似文献
4.
Bahareh Badban Wan Fokkink Jan Friso Groote Jun Pang Jaco van de Pol 《Formal Aspects of Computing》2005,17(3):342-388
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.
Received November 2004
Revised June 2005
Accepted July 2005 by J. V. Tucker 相似文献
5.
Martijn Hendriks Barend van den Nieuwelaar Frits Vaandrager 《International Journal on Software Tools for Technology Transfer (STTT)》2006,8(6):633-647
For a case-study of a wafer scanner from the semiconductor industry it is shown how model checking techniques can be used
to compute (1) a simple yet optimal deadlock avoidance policy, and (2) an infinite schedule that optimizes throughput. in
the absence of errors. Deadlock avoidance is studied based on a simple finite state model using Smv, and for throughput analysis a more detailed timed automaton model has been constructed and analyzed using the Uppaal tool. The Smv and Uppaal models are formally related through the notion of a stuttering bisimulation. The results were obtained within 2 weeks, which
confirms once more that model checking techniques may help to improve the design process of realistic, industrial systems.
Methodologically, the case study is interesting since two models were used to obtain results that could not have been obtained
using only a single model.
Supported by the European Community Project IST-2001-35304 (Ametist), http://ametist.cs.utwente.nl/. 相似文献
6.
Falk Bartels Ana Sokolova Erik de Vink 《Electronic Notes in Theoretical Computer Science》2003,82(1):57-75
We arrange various types of probabilistic transition systems studied in the literature in an expressiveness hierarchy. The expressiveness criterion is the existence of an embedding of systems of the one class into those of the other. An embedding here is a system transformation which preserves and reflects bisimilarity. To facilitate the task, we define the classes of systems and the corresponding notion of bisimilarity coalgebraically and use the new technical result that an embedding arises from a natural transformation with injective components between the two coalgebra functors under consideration. Moreover, we argue that coalgebraic bisimilarity, on which we base our results, coincides with the concrete notions proposed in the literature for the different system classes, exemplified by a detailed proof for the case of general Segala-type systems. 相似文献
7.
Given a
-complete (semi)lattice
, we consider
-labeled transition systems as coalgebras of a functor
(−), associating with a set X the set
X of all
-fuzzy subsets. We describe simulations and bisimulations of
-coalgebras to show that L(−) weakly preserves nonempty kernel pairs iff it weakly preserves nonempty pullbacks iff L is join infinitely distributive (JID).Exchanging
for a commutative monoid
, we consider the functor
(−)ω which associates with a set X all finite multisets containing elements of X with multiplicities m M. The corresponding functor weakly preserves nonempty pullbacks along injectives iff 0 is the only invertible element of
, and it preserves nonempty kernel pairs iff
is refinable, in the sense that two sum representations of the same value, r1 + … + rm = c1 + … + cn, have a common refinement matrix (m(i, j)) whose k-th row sums to rk and whose l-th column sums to cl for any 1≤ k ≤ m and 1 ≤ l ≤ n. 相似文献
8.
移动进程演算中的开互模拟 总被引:1,自引:0,他引:1
该文就移动进程演算中的弱开同余关系进行了研究。文中考虑了一种简单的非确定性移动进程演算模型,证明了Milner的三条tau规则在有等名测试算子时不足以将强开同余关系的完全公理化系统提升到同余关系的完全公理化系统,文中提出了第四条tau规则,处理了在前缀操作下的等名测试算子,并证明了强开同余关系的完全公理化系统加上四条tau规则可得到弱开同余关系的完全公理化系统。该文的结论否定了关于Milner的三条tau规则足以将π-演算中的强同余关系的完全公理化系统提升到弱同余关系的完全公理化系统的猜想。 相似文献
9.
为了增强可形式刻画正则程序行为的带测试克林代数(KAT)的表达能力,提出了一个加概率的带测试克林代数(PKAT)的完整理论用于对加概率正则程序的推演。提出了状态为PKAT表达式和数据状态组成的序列对的概率格局变迁系统。然后在概率格局变迁系统的基础上给出结构操作语义。并给出PKAT的基于操作语义的概率互模拟等价关系。最后证明了PKAT中等式关于互模拟等价的可靠性。 相似文献
10.
S
awomir Lasota 《Theoretical computer science》2002,280(1-2):123-135
We relate two abstract notions of bisimulation, induced by open maps and by coalgebra morphisms, respectively. We show that open maps correspond to coalgebra morphisms for a suitable chosen endofunctor in a category of many sorted sets. This demonstrates that the notion of open-maps bisimilarity is of essentially coalgebraic nature. A central role in our development is played by a category of presheaves, which we show as corresponding to the subcategory of consistent coalgebras with lax cohomomorphisms. 相似文献