By Topic

Symbolic discrete event system specification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. P. Zeigler ; Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA ; S. Chi

An extension of the discrete event system specification modeling formalism (DEVS) that facilitates symbolic expression of event times by extending the time base from the real numbers to the field of linear polynomials over the reals is presented. A simulation algorithm is developed to generate the branching trajectories resulting from the underlying nondeterminism. To efficiently manage symbolic constraints, a consistency checking algorithm for linear polynomial constraints based on a feasibility checking algorithm borrowed from linear programming is developed. The extended formalism offers a convenient means to conduct multiple, simultaneous explorations of model behaviors. Examples of application are given with concentration on fault model analysis

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:22 ,  Issue: 6 )