Syntactic control of concurrency

We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained wi...

Повний опис

Бібліографічні деталі
Автори: Ghica, D, Murawski, A, Ong, L
Формат: Journal article
Мова:English
Опубліковано: Elsevier 2006
Предмети:

Схожі ресурси