Confluence thanks to extensional determinism
A process is extensionally deterministic if, after any trace <em>s</em> and given any event <em>a</em>, it is either certain to accept or certain to refuse <em>a</em> (stably) after <em>s</em>. We show how several process algebras are capable of expres...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2006
|
| Subjects: |