In this note, we report on some work in progress on using rewriting logics for discrete event simulation. The idea is to combine the proofs in the logic with the observations in the simulations to gain a better understanding of the interaction intricacies that seem to occur in complex simulations. I
Some chains of Discrete Event Systems
✍ Scribed by G. De Sarrazin; Juan E. Rondón
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 310 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we investigate opacity of discrete event systems. We define two types of opacities: strong opacity and weak opacity. Given a general observation mapping, a language is strongly opaque if all strings in the language are confused with some strings in another language and it is weakly op
A single maximally permissive and nonblocking supervisor to simultaneously ful"ll several marked speci"cations pertaining to a single plant is investigated. Given a plant G and two marked speci"cation languages K and K , a supervisor S is said to be (K , K )-mutually nonblocking if (for i, j"1,2) ¸(
Welcome to the Special Issue of the Journal of Robotics and Autonomous Systems on 'Discrete Tarek M. Sobh reccivcd the B.Sc. ill Engineering degrcc with honors in Computer Science and Automatic Control from the Faculty of Lngineer ing, Alexandria University. Egypt in 1988, and M.S. and Ph. D. degree