Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Taubner D. — Finite кepresentations of CCS and TCSP зrograms by фutomata and Petri Nets
Taubner D. — Finite кepresentations of CCS and TCSP зrograms by фutomata and Petri Nets

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Finite кepresentations of CCS and TCSP зrograms by фutomata and Petri Nets

Автор: Taubner D.

Аннотация:

This work relates different approaches for the modelling of parallel processes.
On the one hand there are the so-called 'process algebras' or 'abstract programming languages' with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives.
On the other hand there are machine models, viz. the classical finite state automata (transition systems), for which however more discriminating notions of equivalence than equality of languages are used; and secondly there are differently powerful types of Petri nets, namely safe, respectively general (place/transition) nets, and predicate/transition nets.
Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano, De Nicola, Montanari, and Olderog which is based on infinite safe nets.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1989

Количество страниц: 168

Добавлена в каталог: 10.02.2011

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$[term}_{TCSP}$      19
$\alpha$-congruence      10
$\bf D$      23
$\bf L$      126
$\cal D|.|$      142
$\cal E|.|$      79
$\cal F|.|$      64
$\cal G|.|$      133
$\cal L|.|$      76
$\cal N|.|$      101
$\cal P$      165
$\cal R$      127
$\cal T|.|$      23
$\cal {T}_{\tau}|.|$      39
$\checkmark$      (tick) 18
$\checkmark$traces      47
$\gamma$      131 145
$\kappa$      76
$\mathcal P$      165
$\mathcal R$      127
$\mu$-not at ion      9
$\mu$-notation      9
$\nu$      38
$\Sigma$      41
$\surd$ (tick)      18
$\surd$traces      47
$\tau$      13
${D}_{>>}$      142
${D}_{\tau}$      39
${Fun}_{\perp}$      62
${Sig}_{A}$      13
${Sig}_{\bf A}$      13
${terms}_{ccs}$      17
${terms}_{TCSP}$      19
${terms}_{\checkmark}$      18
${terms}_{\surd}$      18
${terms}_{\tau}$      16
${\bf D}_{\gg}$      142
${\bf D}_{\tau}$      39
${\mathcal D}\mathopen{[\![}\cdot\mathclose{]\!]}$      142
${\mathcal E}\mathopen{[\![}\cdot\mathclose{]\!]}$      79
${\mathcal F}\mathopen{[\![}\cdot\mathclose{]\!]}$      64
${\mathcal G}\mathopen{[\![}\cdot\mathclose{]\!]}$      133
${\mathcal L}\mathopen{[\![}\cdot\mathclose{]\!]}$      76
${\mathcal N}\mathopen{[\![}\cdot\mathclose{]\!]}$      101
${\mathcal T}\mathopen{[\![}\cdot\mathclose{]\!]}$      23
${\mathcal T}_{\tau}\mathopen{[\![}\cdot\mathclose{]\!]}$      39
${\nu}$      38
.cl      11
A      12
abbreviations      15 18
Abstract program      7 14
Abstract programming language      7
Abstract programming language, semantics distributed operational      142
Abstract programming language, semantics interleaving operational      21
Abstract programming language, semantics, distributed operational      142
Abstract programming language, semantics, interleaving operational      21
Abstract programming language, syntax      8
Abstraction      see “Hiding”
Act, ${Act}_{\perp}$      13
action      13
Action manipulation      13
Alph, $\overline{Alph}$      13
arrows      22
Arrows, $I - a \twoheadrightarrow J$      142
Arrows, $M \lbrack I - a \twoheadrightarrow J \rangle M'$      142
Arrows, $M[I\;-\;a\;\twoheadrightarrow\;J\rangle{M'}$      142
Arrows, $P - a \rightarrow Q$      23
Arrows, $P - a {\rightarrow}_{\tau} Q$      39
Arrows, $P {\makebox[0pt][l]{/}\rhd} {p}$      78
Arrows, $P {\makebox[0pt][l]{/}\rhd}$      78
Arrows, $P {\makebox[0pt][l]{/}\rhd}_{p}$      77
Arrows, $P {\makebox[0pt][l]{/}\rhd}}$      78
Arrows, $P {\rhd} {p}$      78
Arrows, $P {\rhd}$      77
Arrows, $P {\rhd}_{p} C$      77
Arrows, $P {\rhd}_{p}$      77
Arrows, $P\; -\;a\;\rightarrow\;Q$      23
Arrows, $P\; -\;a\;\twoheadrightarrow\;J$      142
Arrows, $P\; -\;a\;{\rightarrow}_{\tau}\;Q$      39
Arrows, $P\;{\ntriangleright}$      78
Arrows, $P\;{\ntriangleright}\;{p}$      78
Arrows, $P\;{\ntriangleright}_{p}$      77
Arrows, $P\;{\triangleright}$      78
Arrows, $P\;{\vartriangleright}$      77
Arrows, $P\;{\vartriangleright}\;{p}$      77
Arrows, $P\;{\vartriangleright}_{p}$      77
Arrows, $P\;{\vartriangleright}_{p}\;C$      77
Arrows, $r - a {\rightarrow}_{D} s$      22
Arrows, $r - a {\rightarrow}_{i} s$      22
Arrows, $r = w {\Rightarrow}_{D} s$      22
Arrows, $r\; -\;a\;{\rightarrow}_{D}\;s$      22
Arrows, $r\; -\;a\;{\rightarrow}_{i}\;s$      22
Arrows, $r\; -\;\omega\;{\nrightarrow}_{D}$      22
Arrows, $r\; -\;\omega\;{\rightarrow}_{D}$      22
Arrows, $r\; =\;\omega\;{\nRightarrow}_{D}$      22
Arrows, $r\; =\;\omega\;{\Rightarrow}_{D}$      22
Arrows, $r\; =\;\omega\;{\Rightarrow}_{D}\;s$      22
Arrows, $s - w {\nrightarrow}_{D}$      22
Arrows, $s - w {\rightarrow}_{D}$      22
Arrows, $s = w {\nRightarrow}_{D}$      22
Arrows, $s = w {\Rightarrow}_{D}$      22
Arrows, $s {\nrightarrow}_{D}$      22
Arrows, $s {\rightarrow}_{D}$      22
Arrows, $s {\uparrow}_{D}$      22
Arrows, $s{\nrightarrow}_{D}$      22
Arrows, $s{\rightarrow}_{D}$      22
Arrows, $s{\uparrow}_{D}$      22
Arrows, ${M}_{1}[d>{M}_{2}$      98
Arrows, ${M}_{1}[d\ralgle{M}_{2}$      98
Arrows, ${[Z>}_{D}$      98
Arrows, ${[Z\ragle}_{D}$      98
Autobisimulation      25
Barendregt convention      11
Bisimularity, congruence      27
Bisimularity, strong      25 63
Bisimularity, weak      27
Change of bound identifier      10
Cl      11
Cl terms      see “Cl”
Closed term      11
Consistent representation, with Petri nets      99
Consistent representation, with transition systems      76
Conterms      76
Context relation $(\rhd)$      77
Context relation $(\vartriangleright)$      77
contexts      76
Counter      49
Counter, contained in a language      119
D      23
DEC      140
div      43
Divergence free      27
Divergences      27
Divs      27
e      79
Equivalences      25
Equivalences, $\approx$      (weak bisimularity) 27
Equivalences, $\approx$ (weak bisimularity)      27
Equivalences, $\cong$ (isomorphism), extended safe nets      100
Equivalences, $\cong$ (isomorphism), extended trans, systems      63
Equivalences, $\cong$ (isomorphism), transition systems      22
Equivalences, $\cong$, (isomorphism), extended safe nets      100
Equivalences, $\cong$, (isomorphism), extended trans, systems      63
Equivalences, $\cong$, (isomorphism), transition systems      22
Equivalences, $\dot{\equiv}$      (abs. syntactic identity) 9
Equivalences, $\dot{\equiv}$ (abs. syntactic identity)      9
Equivalences, $\equiv$      (syntactic equality) 10
Equivalences, $\equiv$ (syntactic equality)      10
Equivalences, $\overset{S,D}{\sim}$      25
Equivalences, $\sim$ (strong bisimularity), extended trans, systems      63
Equivalences, $\sim$ (strong bisimularity), transition systems      25
Equivalences, $\stackrel{S.D}{~}$      25
Equivalences, ${=}_{div}$      (divergence) 27
Equivalences, ${=}_{div}$ (divergence)      27
Equivalences, ${=}_{fail}$      (failure) 27
Equivalences, ${=}_{fail}$ (failure)      27
Equivalences, ${=}_{test}$      (testing) 27
Equivalences, ${=}_{test}$ (testing)      27
Equivalences, ${=}_{tr}$      (trace) 27
Equivalences, ${=}_{tr}$ (trace)      27
Equivalences, ${\approx}_{+}$      (bisimulation congr.) 27
Equivalences, ${\approx}_{+}$ (bisimulation congr.)      27
Equivalences, ${\equiv}_{\alpha}$      ($\alpha$-congruence) 10
Equivalences, ${\equiv}_{\alpha}$ ($\alpha$-congruence)      10
Equivalences, ${\sim}_{\lefteqn{|}{\rm S}}$      25
Equivalences, ${~}_{s}$      25
Equivalences, ~ (strong bisimularity), extended trans, systems      63
Equivalences, ~ (strong bisimularity), transition systems      25
EVis      13
Extended safe net      99
Extended transition system      62
Extended transition system of a term      79
Extended transition system of an extended safe net      100
Extended transition system, of a term      79
Extended transition system, of an extended safe net      100
Extension, safe net      99
Extension, transition system      62
External choice      19
failures      27
fi      9
fix      9
fun      13
Grape      140
Grape, complete set of -s      140
Grapes      140
hiding      13 15
Hot context relation $(\triangleright)$      78
Hot context relation $(\vartriangleright)$      78
Hot extension      63
Identifier      8
Identifier, bound      9
Identifier, free      9
IDF      8
Initials      27
Internal non-determinism      15
Invisible action      13
L      126
Marking, Petri net      98
Marking, predicate/transition net      133
Minimal transition system      31
Net      97
NI      82
NIL      13
Nil insertion      82
Nilterms      82
Onesyn      146
Parallel composition      14
Parallel composition, ACP      20
Parallel composition, CCS      15
Parallel composition, TCSP      15
Parallel composition, Winskel's      15
Petri net      97
Petri net, conventional notation      97
Place invariant      115
Plain term      8
Predicate/transition net, conventional notation      129
Predicate/transition net, shorthand notation      127
Prefixing      13
Proper termination      38
PrT-net      see “Predicate/transition net”
Qterm      16
Qterms      16
Quotient of a transition system      30
Reach, extended safe net      100
Reach, extended transition system      63
Reach, safe Petri net      99
Reach, transition system      30
Reachable markings      98
Reachable subnet, extended safe net      100
Reachable subnet, safe Petri net      99
Reachable subsystem, extended transition system      63
Reachable subsystem, transition system      30
REC      8
Regular term      57
renaming      13
Renaming, finite      70
Representable      57
Restriction      13 15
Safe Petri net      98
Safe Petri net of a qterm      142
Safe predicate/transition net      132
Safe-net-semantics      132
Safenet      132
Sequential composition      18
Signature      8
Singterms      16
Singular term      16
Singular transition      127
skip      18
Smdjof      135
State machine decomposition      113
Substitution lemma      12
Subterm      11
SUM      14
Symbolic sum      129
Symbolic transition rule      133
Synchronization transition      127
Syntactic substitution      10
Sysums      129
Term      10
Terminating traces      47
Terms      14
Ticks      18
Traces, Petri nets      119
Traces, transition systems      27
Transition system      21
Transition system, associated with a net      99
Transition system, of a term      23
Transys, extended safe nets      100
Transys, safe nets      99
Turing power      49
VIS      13
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте