![]() |
|
| ACSR - Algebra of Communicating Shared Resources |
A-B-C- D-E-F- G-H-I- J-K-L- M-N-O- P-Q-R- S-T-U- V-W-X- Y-Z
Contents
|
|
|---|
Identification
Homepage
http://www.cis.upenn.edu/~rtg/formalismdesc.html
Institution
Observations
The Algebra of Communicating Shared Resources, ACSR, is a timed process algebra that is based on the premise that the timed behavior of a real-time
system is affected not only by the time its components take to execute and synchronize, but also by delays introduced due to the scheduling of actions
that compete for shared resources.
The ACSR computation model is based on the view that the components of a real-time system execute synchronously time and resource consuming
actions and communicate through instantaneous events asynchronously, except when two components synchronize through matching events. To be
able to specify real-time systems accurately, ACSR supports static priorities that can be used to arbitrate between actions competing for shared
resources and between events that are ready for synchronization. ACSR also offers different notions of equivalence that can be used to verify that two
specifications behave the same
Publications
Classifications GDPA Online
Last Updated 01.Jan.2002
Updated by Webmaster
Last Revised 01.Jan.2002
Revised by Webmaster
![]() |