| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421613 | Electronic Notes in Theoretical Computer Science | 2009 | 15 Pages |
Abstract
Simulation rules have long been used as an effective computational means to decide refinement relations in state-based formalisms. Here we investigate how they might be amended so as to decide the event-based notion of singleton failures refinement of abstract data types, or processes, that have operations with a “guarded” interpretation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
