全文获取类型
收费全文 | 882篇 |
免费 | 22篇 |
国内免费 | 25篇 |
专业分类
电工技术 | 12篇 |
综合类 | 17篇 |
化学工业 | 19篇 |
金属工艺 | 15篇 |
机械仪表 | 53篇 |
建筑科学 | 24篇 |
矿业工程 | 7篇 |
能源动力 | 13篇 |
轻工业 | 3篇 |
水利工程 | 2篇 |
石油天然气 | 7篇 |
武器工业 | 6篇 |
无线电 | 86篇 |
一般工业技术 | 82篇 |
冶金工业 | 16篇 |
原子能技术 | 37篇 |
自动化技术 | 530篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 13篇 |
2020年 | 13篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 22篇 |
2016年 | 18篇 |
2015年 | 23篇 |
2014年 | 45篇 |
2013年 | 33篇 |
2012年 | 33篇 |
2011年 | 66篇 |
2010年 | 49篇 |
2009年 | 43篇 |
2008年 | 56篇 |
2007年 | 83篇 |
2006年 | 81篇 |
2005年 | 56篇 |
2004年 | 40篇 |
2003年 | 37篇 |
2002年 | 26篇 |
2001年 | 22篇 |
2000年 | 31篇 |
1999年 | 19篇 |
1998年 | 20篇 |
1997年 | 20篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 3篇 |
1992年 | 9篇 |
1991年 | 4篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有929条查询结果,搜索用时 358 毫秒
31.
The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at various levels of abstraction. The operational semantics of Paradigm is given. For a large, general subclass of Paradigm models a translation into process algebra is provided. Once expressed in process algebra, relying on a correctness result, Paradigm models are amenable to process algebraic reasoning and to verification via the mCRL2 toolset. Examples of a scheduling problem illustrate the approach. 相似文献
32.
We introduce STORMED hybrid games (SHG), a generalization of STORMED hybrid systems, Vladimerou et al. (2008) [33], which have natural specifications that allow rich continuous dynamics and various decidable properties. We solve the control problem for SHG using a reduction to bisimulation on finite game graphs. This generalizes to a greater family of games, which includes o-minimal hybrid games, Bouyer et al. (2006) [6]. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems. 相似文献
33.
34.
35.
Constraint-based deductive model checking 总被引:2,自引:0,他引:2
Giorgio Delzanno Andreas Podelski 《International Journal on Software Tools for Technology Transfer (STTT)》2001,3(3):250-270
We show that constraint logic programming (CLP) can serve as a conceptual basis and as a practical implementation platform
for the model checking of infinite-state systems. CLP programs are logical formulas (built up from constraints) that have
both a logical interpretation and an operational semantics. Our contributions are: (1) a translation of concurrent systems
(imperative programs) into CLP programs with the same operational semantics; and (2) a deductive method for verifying safety
and liveness properties of the systems which is based on the logical interpretation of the CLP programs produced by the translation.
We have implemented the method in a CLP system and verified well-known examples of infinite-state programs over integers,
using linear constraints here as opposed to Presburger arithmetic as in previous solutions.
Published online: 18 July 2001 相似文献
36.
37.
Formal approaches to the design of interactive systems rely on reasoning about properties of the system at a very high level
of abstraction. Specifications to support such an approach typically provide little scope for reasoning about presentations
and the representation of information in the presentation. In contrast, psychological theories such as distributed cognition place a strong emphasis
on the role of representations, and their perception by the user, in the cognitive process. However, the post-hoc techniques
for the observation and analysis of existing systems which have developed out of the theory do not help us in addressing such
issues at the design stage. Mn this paper we show how a formalisation can be used to investigate the representational aspects
of an interface. Our goal is to provide a framework to help identify and resolve potential problems with the representation
of information, and to support understanding of representational issues in design. We present a model for linking properties
at the abstract and perceptual levels, and illustrate its use in a case study of a ight deck instrument. There is a widespread
consensus that proper tool support is a prerequisite for the adoption of formal techniques, but the use of such tools can
have a profound effect on the process itself. In order to explore this issue, we apply a higher-order logic theorem prover
to the analysis.
Received May 1999 / Accepted in revised form July 2000 相似文献
38.
仿真可信性的研究综述 总被引:5,自引:1,他引:4
从概念性研究、技术方法和工程应用等三个方面综述了仿真可信性研究的发展。. 相似文献
39.
Modeling and verification of a telecommunication application using live sequence charts and the Play-Engine tool 总被引:1,自引:0,他引:1
We apply the scenario-based approach to modeling, via the language of live sequence charts (LSCs) and the Play-Engine tool
to a real-world complex telecommunication service, . It allows a user to call for help from a doctor, the fire brigade, a car maintenance service, etc. These kinds of services
are built on top of an embedded platform, using both new and existing service components, and their complexity stems from
their distributed architecture, the various time constraints they entail, and their rapidly evolving underlying systems. A
well known problem in this class of telecommunication applications is that of feature interaction, whereby a new feature might
cause problems in the execution of existing features. Our approach provides a methodology for high-level modeling of telecommunication
applications that can help in detecting feature interaction at early development stages. We exhibit the results of applying
the methodology to the specification, animation and formal verification of the Depannage service.
相似文献
Hillel Kugler (Corresponding author)Email: |
40.
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state
space explosion problem. One of the ways to exploit such a semantics is to consider (finite prefixes of) net unfoldings—themselves
a class of acyclic Petri nets—which contain enough information, albeit implicit, to reason about the reachable markings of
the original Petri nets. In [19], a verification technique for net unfoldings was proposed, in which deadlock detection was reduced to a mixed integer linear
programming problem. In this paper, we present a further development of this approach. The essence of the proposed modifications
is to transfer the information about causality and conflicts between the events involved in an unfolding, into a relationship
between the corresponding integer variables in the system of linear constraints. Moreover, we present some problem-specific
optimisation rules, reducing the search space. To solve other verification problems, such as mutual exclusion or marking reachability
and coverability, we adopt Contejean and Devie's algorithm for solving systems of linear constraints over the natural numbers
domain and refine it, by taking advantage of the specific properties of systems of linear constraints to be solved.
Another contribution of this paper is a method of re-formulating some problems specified in terms of Petri nets as problems
defined for their unfoldings. Using this method, we obtain a memory efficient translation of a deadlock detection problem
for a safe Petri net into an LP problem. We also propose an on-the-fly deadlock detection method.
Experimental results demonstrate that the resulting algorithms can achieve significant speedups.
相似文献
Maciej KoutnyEmail: |