van Breugel, Franck (1997) Failures, Finiteness, and Full Abstraction. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
![[img]](http://eprints.adm.unipi.it/style/images/fileicons/application_postscript.png) | Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (88Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-97-18.ps.g...
Abstract
For a simple CCS-like language a trace semantics and a failure semantics are presented. The failure semantics is shown to be fully abstract with respect to the trace semantics if and only if the set of internal actions is infinite.
| Item Type: | Book |
|---|---|
| Uncontrolled Keywords: | failure semantics, trace semantics, full abstraction, finiteness |
| Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
| Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
| Depositing User: | dott.ssa Sandra Faita |
| Date Deposited: | 23 Jan 2015 11:15 |
| Last Modified: | 23 Jan 2015 11:15 |
| URI: | http://eprints.adm.unipi.it/id/eprint/1983 |
Repository staff only actions
| View Item |
