http://www.ifac-papersonline.net/ en Copyright 05:45 PM Tuesday 07, 2012 IFAC-PapersOnline http://www.ifacpapersonline.com 05:45 PM Tuesday 07, 2012 05:45 PM Tuesday 07, 2012 ET webmaster@ifac-papersonline.net webmaster@ifac-papersonline.net http://www.ifac-papersonline.net/Detailed/42341.html 04:00 PM Wednesday 31, 1969 The task of simple decomposition of a Boolean function, generally non-disjunctive, is considered, its solution is reduced in main to search for appropriate weak partitions on the set of arguments. A special attention is paid to the case of presence of a good solution for the given Boolean function, in remaining random. To find it, a twostage heuristic combinatorial algorithm is offered, optimized on speed. At the first stage the randomized search for "traces" of the decomposition is fulfilled. These traces are represented by some "triads" - the simplest weak partitions corresponding to non-trivial decompositions. At the second stage the whole sought-for partition is restored from the discovered trace. The results of computer experiments confirming practical efficiency of the algorithm are quoted. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42347.html 04:00 PM Wednesday 31, 1969 The concept of generalized compact table as a form of specification of a Boolean function is introduced. This form is a further generalization of the decomposition chart and uses the concept of ternary matrix cover. A method for decomposition of a Boolean function using its representation in the form of generalized compact table is given. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42372.html 04:00 PM Wednesday 31, 1969 The paper presents an RTCP-net approach to the verification of embedded systems implemented in Ada programming language. We focus on the verification of software implemented in accordance with Ada Ravenscar Profile. An RTCP-net model is constructed with the use of the Ada source code, and utilised for the formal verification of the software. An example of a driver for a home heating furnace is used to demonstrate the most important features of this approach. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42351.html 04:00 PM Wednesday 31, 1969 High-speed telecommunications routers are very important systems in today's networked environments. In order to improve their quality of service, it is important to provide them with means to detect errors that affect their behaviour. If such detection is performed concurrently with normal operation, the negative effects of errors could be mitigated or even avoided, leading to fault-tolerant operation. This work concentrates on the scheduler part of the system and, in particular, on concurrent error detection in circuits implementing the well-known iSLIP scheduling algorithm. The faulty behaviour of complex digital processing systems is usually better described at the algorithmic level, particularly when the operation of the system relies on complex mathematical principles. Therefore, the issues related to concurrent error detection are addressed from a mathematical model of the target system. Results are presented that point to the ability of the proposed solution to detect errors at a high abstraction level. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42357.html 04:00 PM Wednesday 31, 1969 We plunge decentralized control problems into modular ones to benefit from the know-how of modular control theory: any decentralized control problem is associated to a natural modular control problem, which over-approximates it. Then, we discuss how a solution of the latter problem delivers a solution of the former. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42379.html 04:00 PM Wednesday 31, 1969 Applications on manufacturing systems (diagnosis, control, supervision...) often require a plant model. Obtaining the plant model is a difficult task because of systems complexity and deepth knowledge of physical materials. A necessary condition that must be verified by the plant model is its capability to respond to all the requests of the specification model. This paper ends by two complementary approaches a mathematical property is proposed to check formally and this capability and a methodology to design the plant model is proposed in order to guarantee the model capability according to the most permissive control model. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42342.html 04:00 PM Wednesday 31, 1969 In this paper, using FIR filters as an example, the discussion on efficiency of different implementation methodologies used in DSP application targeted modern FPGA architectures is presented. Nowadays programmable technology provides possibility to implement digital system with use of specialized embedded DSP blocks. On the first place, however, this technology gives the designer the possibility to increase efficiency of designed system by exploitation of parallelisms of implemented algorithms. Moreover, it is possible to apply special techniques, such as distributed arithmetic (DA). Since in this approach general purpose multipliers are replaced by combinational LUT blocks, it allows constructing digital filters of very high performance. Additionally, application of the functional decomposition based method to LUT blocks optimisation and mapping has been investigated. The paper presents results of comparison of different design approaches. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42344.html 04:00 PM Wednesday 31, 1969 This work proposes a new approximation to design and program Complex Adaptive Systems (CAS), these systems comprise neural network, intelligent agents, genetic algorithms, support vector machines and artificial intelligence systems in general. Due to the complexity of such systems, it is necessary to build a design environment able to ease the design work, allowing reusability and easy migration to hardware and/or software. Ptolemy II is used as the base system to simulate and evaluate the designs with different Models of Computation so that an optimum decision about the hardware or software implementation platform can be taken. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42361.html 04:00 PM Wednesday 31, 1969 In the paper a new method of analysis of safeness, liveness and persistence properties of Petri nets is presented. This method is based on hierarchical representation of the state space of a Petri net by means of a collection of monotone logical functions and with related set of binary decision diagrams. The algorithm of symbolic analysis of a Petri net based behavioural specification of logic controllers is given, together with conditions, which allow analysing the properties mentioned above. One of the advantages of the proposed method is a possibility of detail analysis of selected local parts of a Petri net, as well as hierarchical approach for constructing the total state space. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42382.html 04:00 PM Wednesday 31, 1969 In the paper application of databases for management of the distributed control system is discussed. The proposed system consists of three levels. A considered part of the system corresponds to manage of data. The data transfer between levels of the system is managing using Oracle database. A data management part is responsible for storing information about control system and data flow between levels of the system. The considered control system is specified by Petri net, FSM and HDLs. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42367.html 04:00 PM Wednesday 31, 1969 The paper presents the arbitration circuit that was designed for a classical multiprocessor system with a common memory and a time-sharing bus. The arbitration algorithm called "with cyclically shifted priorities" was implemented in this arbiter. The arbitration circuit was designed as modular and expandable. Thanks to proper hardware solutions the arbiter has a simply logic structure. This logic structure was implemented in FPGA. Operation of the arbiter in the real multiprocessor system was described. Block diagrams of all parts of this arbitration circuit were shown. A queueing model of the multiprocessor system with the arbiter was presented. Thanks to this, it was possible to predict performance of this system. The method of performance calculation of the multiprocessor system with the presented arbitration circuit was described. The analytic results were compared with the corresponding measured results that were obtained in the real multiprocessor system. The analytic and measured results were shown in a graphic form in figures. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42360.html 04:00 PM Wednesday 31, 1969 Automata formalism has been used extensively in control design of Discrete Event Systems (DES) and, realization methodologies to implement automata that are synthesized using formal methods are needed. In this study, we present a methodology that can be used to express a given automaton in logical domain. Using this methodology, a Matlab program which automatically generates Programmable Logic Controller (PLC) codes that realize the given automaton has been developed. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42355.html 04:00 PM Wednesday 31, 1969 The paper presents modified idea of program execution in the Programmable Logic Controllers (PLCs). Instead of serial cyclic execution is proposed event sensitive cyclic execution. Proposed approach to program execution allow for selective execution of program blocks or tasks provided calculation condition for this part has changed since last time. Proposed method can be implemented as software modification or as hardware accelerated solution. The most important part of the idea is task or subprogram triggering condition computation. Different method of program optimization are discussed. Finally hardware implementation of event triggered system is presented. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42366.html 04:00 PM Wednesday 31, 1969 This paper explains why the 8-bit microcontroller IP cores are still popular in system on chip designs. It presents R8051XC configurable microcontroller core (developed at Evatronix SA) with a focus on the implemented enhancements of this popular instruction set architecture and on the configurability of the core. For microcontrollers embedded in ASIC or ASSP circuits effective support for software development is very important. Therefore on chip debug support (OCDS) solutions developed for R8051XC are presented along with prototyping environment and real time operating system port available for R8051XC follows. Finally application specific solutions based on R8051XC and oriented towards USB-interfaced and Ethernet-interfaced systems have been presented. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42370.html 04:00 PM Wednesday 31, 1969 A method of designing of Compositional Microprogram Control Units with Elementary Operational Linear Chains is proposed. The method is based on the special encoding of the Operational Linear Chains. Such an approach permits to decrease the number of logic blocks of the destination FPGA device. An exemplary application of the proposed method is discussed. The investigations conducted by the author have shown that the proposed method permits to decrease the usage of the logic blocks of destination device up to 20%. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42386.html 04:00 PM Wednesday 31, 1969 It is very difficult to achieve guaranteed real time database services when putting a database into a real-time environment because various components can compete for system resources. Previous research in real-time databases has focused primarily on evolution of transaction processing algorithms, priority assignment strategies and concurrency control techniques. But for the most part the research efforts are based only on simulation studies with many parameters defined. Our objective is to design and implement an experimental real-time database system suitable for study of real time transaction processing. The experimental system is implemented as an integrated set of the most important functional parts upon the real-time operating system VxWorks. It serves as a support platform for performance evaluation of known and new algorithms of the particular processing components to understand their effect on system performance and to identify the most influencing factors. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42388.html 04:00 PM Wednesday 31, 1969 Hardware real-time implementations of Spiking Neuron Networks (SNN) are wanted for multiple applications. Introduction of the supervised learning mechanism for SNNs is a hot topic. A model of a single spiking neuron having that property is proposed. This is based on LIF simplified model. A number of design issues has been solved in order to enable the correct work of such a neuron during learning phase. The proposed extensions and modifications are described and illustrated with corresponding timing diagrams. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42389.html 04:00 PM Wednesday 31, 1969 The Advanced Encryption Standard algorithm itself does not guarantee error free operation or detection of arising errors. Contemporary research has shown that even single bit errors strongly affect the output of the algorithm. Moreover an attacker may maliciously induct errors during the run of the AES in order to perform cryptanalysis and recover the encryption secret key. In this paper we propose an extension of error detection code for AES, known from an open literature. The implementation of our idea leads to the improvement of error detection ability and reduces of the probability of successful fault analysis below 2-7. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42352.html 04:00 PM Wednesday 31, 1969 The general objective of this project is to create an environment for discrete event simulation to assess safety properties of databuses used in real-time applications, especially in automotive and avionics industries. In this paper, we describe several extensions of the TrueTime simulator, beginning with the development of the fault injection model and incorporating it into the simulator using Matlab S-functions in C++. We also discuss an interface to TrueTime to simulate hardware faults via Matlab/Simulink with the use of HDL/Spice tools and high-level object-oriented programming models, which simulate software and hardware faults. Finally, we are suggesting graphical user interface extensions to TrueTime using LabVIEW that prove necessary for efficient experimental data generation, gathering and analysis. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42349.html 04:00 PM Wednesday 31, 1969 The principle of reconfiguring digital hardware for testing is now widely accepted. Built-in self-test is also now established technology. Self-testability can be thought of as a design objective, in a similar manner to speed, area and power. Thus high-level synthesis tools can be designed to explore a design space that includes testability and to search for optimal implementations. In this context, self-test would normally be performed off-line, but on-line test structures can also be created. Using high-level synthesis allows efficient reuse of resources for self-checking. A further design objective might be dynamic reconfiguration. By combining self-checking and selfreconfiguration, it is possible to create a fault-tolerant computing fabric. This paper describes our recent research in synthesis for self-test, self-checking, reconfiguration and self-repair. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42365.html 04:00 PM Wednesday 31, 1969 Statechart diagrams are very convenient way in specifying behavior of reactive systems and controllers in particular. The system modelled as a statechart can be directly implemented in reprogrammable devices. Mathematical model of statechars gives an opportunity to verify symbolically some properties and to transform into FSM-description. Having statechart in FSM-description allow to implement controllers in embedded array blocks. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42340.html 04:00 PM Wednesday 31, 1969 http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42348.html 04:00 PM Wednesday 31, 1969 The paper presents a practical application of Gentzen theorem proving system by means of an experimental computer tool, for the purpose of logic expressions normalization into the form similar to the Horn clauses. The initial expressions are described as complicated nested condition rules in general rule-based form "IF THEN". Additionally the paper describes a particular kind of logic algorithms optimization and some possibilities of increasing of efficiency of the presented application, for the normalizing a great number of symbolic expressions. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42343.html 04:00 PM Wednesday 31, 1969 Hardware Embedded DEductive Fault Simulation (HEDEFS) is a hardware-software realization of a deductively-parallel topological method of faults modeling. The method uses ad hoc technology of the analysis of converging branching, back-word modeling of faults simulation, and transformation of testable circuits; and is oriented on handling of digital circuits with big dimension represented on gate or RT description levels. Structural hardware solutions for realization of the method are presented at an estimation of quality of generated tests. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif http://www.ifac-papersonline.net/Detailed/42353.html 04:00 PM Wednesday 31, 1969 Systems on a Chip (SoCs) typically consist of several processor devices, embedded memory blocks, application-specific logic blocks and complex interconnects. While embedded memory blocks are mostly equipped with built-in self test (BIST) capabilities, test methods for processors, logic blocks and interconnects are still topics of intensive research. Beyond production testing, SoCs in safety-critical applications also need built-in self test capabilities, which work independently from external control hardware. A HW / SW -based self test scheme can facilitate self test in the field of application making efficient use of structures for production test and can even supplement production test, e.g. for internal interconnects. The paper describes the architecture, cost and limitations. http://www.ifac-papersonline.net/static/luna/images/ifac/icon-download.gif