在工厂使用的以太网增强了坚固性

坚固化工业技术驱动了产品的可靠、安全和智能。因此以大网向工业现场的转移获得了稳步的增长,很多大企业已经明确地把以太网作为工厂现场网络的选择。     

Deciding determinism of caterpillar expressions

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.     

QoS-oriented design of embedded systems with specification PEARL

Only recently have methodical tools adequate to design real-time systems been formally introduced in design methodologies. Naturally, they were present from the beginning, but due to the large diversity of embedded systems’ areas of deployment, specially dedicated formalisms have been developed and used. High-level language programming and integration of modeling formalisms into design methods eased the development of more complex real-time applications. With the emerging object-oriented programming languages and design methods, their integration into larger information systems has become more transparent. It was the UML methodology, however, which eventually merged also the design methods and concepts of real-time systems into a consistent whole. It took a large consortium and a long process to persuade industry of the benefits the new integral methodology can offer. On the other hand, there are some trade-offs, and there are some features not completely covered, yet. Here, a different, more straightforward approach to program and design (embedded) real-time systems is presented. Since it emerged from the real-time community, it includes most features relevant there. Independent of the UML profile for schedulability, performance and time specification, a profile was devised for use in PEARL-oriented UML design. The strengths of the mentioned language and design methods for QoS-oriented design of (embedded) real-time systems are emphasised throughout this article.     

Compositional State Space Reduction Using Untangled Actions

We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a failure-based equivalence which preserves divergences) that determines their sets of “conflict-free” actions, called untangled actions. Untangled actions are compositional, i.e. synchronisation on untangled actions will not destroy their “conflict-freedom”. For networks of processes, using global untangled actions derived from local ones, efficient reduction algorithms have been devised for systems with a large number of small processes running in parallel.     

英吉沙小刀在“环境决定论”视角下的色彩意涵

英吉沙小刀的色彩应用形式是构成其造型特征的主要因素，它反映着维吾尔民族对自然界色彩的审视态度与审美意趣。笔者通过详实的实物调研并结合相关的前学成果，对“英吉沙小刀”的地域模仿性、文化象征性、装饰表现性三方面进行综合的考察，以此揭剥在特定的环境下色彩应用方式中所包含的民族心理和文化意涵。     

智慧地构建工业以太网

安装一个工业以太网还远远不够,还要维护工厂控制网络的高性能和高安全性,所以要实施智能的以太网服务。     

When is partial trace equivalence adequate?

Two processes arepartial trace equivalent iff they can perform the same sequences of actions in isolation. Partial trace equivalence is perhaps the simplest possible notion of process equivalence. In general, it is too simple: it is not usually an adequate semantics. We investigate the circumstances under which it is adequate, which are surprisingly rich. We give two substantial classes of languages for which partial traces are adequate. In one class, partial trace equivalence suffices for total correctness, and operations such as true sequencing are possible; but all processes are determinate and silent moves are not possible. The other class — which includes many standard process calculi, such as CCS and CSP — admits indeterminacy and silent moves, but partial traces only suffice for partial correctness and true sequencing is not definable.Supported by NSF grant (CCR-9003441)     

Yada: Straightforward parallel programming

Now that multicore chips are common, providing an approach to parallel programming that is usable by regular programmers has become even more important. This cloud has one silver lining: providing useful speedup on a program is useful in and of itself, even if the resulting performance is lower than the best possible parallel performance on the same program. To help achieve this goal, Yada is an explicitly parallel programming language with sequential semantics. Explicitly parallel, because we believe that programmers need to identify how and where to exploit potential parallelism, but sequential semantics so that programmers can understand and debug their parallel programs in the way that they already know, i.e. as if they were sequential.The key new idea in Yada is the provision of a set of types that support parallel operations while still preserving sequential semantics. Beyond the natural read-sharing found in most previous sequential-like languages, Yada supports three other kinds of sharing. Writeonce locations support a single write and multiple reads, and two kinds of sharing for locations updated with an associative operator generalise the reduction and parallel-prefix operations found in many data-parallel languages. We expect to support other kinds of sharing in the future.We have evaluated our Yada prototype on eight algorithms and four applications, and found that programs require only a few changes to get useful speedups ranging from 2.2 to 6.3 on an 8-core machine. Yada performance is mostly comparable to parallel implementations of the same programs using OpenMP or explicit threads.     

确定性提高了精确度

确定性的网络同步了物体移动,所以快速处理可以保持精确度。