000 02397nam a22003738i 4500
001 CR9780511526589
003 UkCbUP
005 20200124160237.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 090407s1991||||enk o ||1 0|eng|d
020 _a9780511526589 (ebook)
020 _z9780521400442 (hardback)
020 _z9780521018456 (paperback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA76.58
_b.O43 1991
082 0 0 _a004.3/5
_220
100 1 _aOlderog, E.-R,
_eauthor.
245 1 0 _aNets, terms, and formulas :
_bthree views of concurrent processes and their relationship /
_cE.-R. Olderog.
246 3 _aNets, Terms & Formulas
264 1 _aCambridge :
_bCambridge University Press,
_c1991.
300 _a1 online resource (x, 267 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aCambridge tracts in theoretical computer science ;
_v23
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520 _aThe author presents a theory of concurrent processes where three different semantic description methods that are usually studied in isolation are brought together. Petri nets describe processes as concurrent and interacting machines; algebraic process terms describe processes as abstract concurrent processes; and logical formulas specify the intended communication behaviour of processes. At the heart of this theory are two sets of transformation rules for the top-down design of concurrent processes. The first set can be used to transform stepwise logical formulas into process terms, whilst process terms can be transformed into Petri nets by the second set. These rules are based on novel techniques for the operational and denotational semantics of concurrent processes. Various results and relationships between nets, terms and formulas starting with formulas and illustrated by examples. The use of transformations is demonstrated in a series of case studies, and the author also identifies directions for research.
650 0 _aParallel processing (Electronic computers)
650 0 _aSystem design.
776 0 8 _iPrint version:
_z9780521400442
830 0 _aCambridge tracts in theoretical computer science ;
_v23.
856 4 0 _uhttps://doi.org/10.1017/CBO9780511526589
999 _c518216
_d518214