Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Hesselink:1992:PFU,
author = "W. H. Hesselink",
title = "Processes and formalisms for unbounded choice",
journal = j-THEOR-COMP-SCI,
volume = "99",
number = "1",
pages = "105--119",
day = "01",
month = jun,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Rijksuniv. Groningen,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "angelic choice; demonic choice; program refinement;
programming theory; specification algebras;
specification construct; specification languages;
unbounded choice",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}