𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Discrete Event Systems in Rewriting Logic

✍ Scribed by Christopher Landauer

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
550 KB
Volume
4
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis

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. In particular, we use communication protocols as our application domain, since they have all the interaction and unpredictability that makes formal speci cations di cult.

πŸ“œ SIMILAR VOLUMES

Tiling Transactions in Rewriting Logic
Tiling Transactions in Rewriting Logic
✍ Roberto Bruni; JosΓ© Meseguer; Ugo Montanari πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 313 KB
Discrete event systems in robotics and a
Discrete event systems in robotics and automation
✍ Tarck M. Sobh; Kimon P. Valavanis πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 160 KB

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

CCS Semantics via Proved Transition Syst
CCS Semantics via Proved Transition Systems and Rewriting Logic
✍ Georgia Carabetta; Pierpaolo Degano; Fabio Gadducci πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 959 KB

We consider (a slight v ariant of) the ccs calculus, and we analyze two operational semantics de ned in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We s h o w that the interleaving interpretation of both semantics agree, in that they de ne th