China
Africa
Explore chapters and articles related to this topic
Embedded Software Modeling and Design
Published in Louis Scheffer, Luciano Lavagno, Grant Martin, EDA for IC System Design, Verification, and Testing, 2018
In FSMs process behavior is specified by enumerating the (finite) set of possible system states and the transitions among them. Each transition connects two states and it is labeled with the subset of input variables (and possibly the guard condition upon their values) that triggers its execution. Furthermore, each transition can produce output variables. In Mealy FSMs, outputs depend on both state and input variables, while in the Moore model, outputs only depend on the process state. Guard conditions can be expressed according to different logics, such as propositional logic, first-order logic, or even Turing-complete programming code.
Models and Tools for Complex Embedded Software and Systems
Published in Luciano Lavagno, Igor L. Markov, Grant Martin, Louis K. Scheffer, Electronic Design Automation for IC System Design, Verification, and Testing, 2017
In FSM, the behavior is specified by enumerating the (finite) set of possible system states and the transitions among them. Each transition connects two states and it is labeled with the subset of input variables (and possibly the guard condition upon their values) that triggers its execution. Furthermore, each transition can produce output variables. In Mealy FSMs, outputs depend on both state and input variables, while in the Moore model, outputs only depend on the process state. Guard conditions can be expressed according to different logics, such as propositional logic, first-order logic, or even (Turing-complete) programming code.
Power Control for Reliable M2M Communication
Published in Hongjian Sun, Chao Wang, Bashar I. Ahmad, From Internet of Things to Smart Cities, 2017
For static networks with constant channels, scheduling and power control is used as a means to guarantee reliability. The performance of conflict graph-based approaches depends on the accuracy of conflict links. A large guard area can bring significant degradation in concurrency while a small guard area may be unable to guarantee reliability. Whatever, all existing algorithms are time consuming. There are few applications of these algorithms in real M2M communication systems.
An election algorithm to ensure the high availability of leader in large mobile ad hoc networks
Published in International Journal of Parallel, Emergent and Distributed Systems, 2018
Shantanu Sharma, Awadhesh Kumar Singh
In this section, we specify the DELFA algorithm as guarded actions. A guarded action is written as: . A guard (or predicate) of actions (or rules) is a Boolean expression, and if a guard is true, then all the actions, corresponding to that guard, are executed in an atomic manner. At some point of time more than one guard may be true. The DELFA algorithm is given in Tables 7 and 8.