Авторизация
Поиск по указателям
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.
Язык:
Рубрика: Computer science /
Статус предметного указателя: Готов указатель с номерами страниц
ed2k: ed2k stats
Год издания: 1989
Количество страниц: 168
Добавлена в каталог: 10.02.2011
Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
19
-congruence 10
23
126
142
79
64
133
76
101
165
127
23
39
(tick) 18
traces 47
131 145
76
165
127
-not at ion 9
-notation 9
38
41
(tick) 18
traces 47
13
142
39
62
13
13
17
19
18
18
16
142
39
142
79
64
133
76
101
23
39
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, 13
action 13
Action manipulation 13
Alph, 13
arrows 22
Arrows, 142
Arrows, 142
Arrows, 142
Arrows, 23
Arrows, 39
Arrows, 78
Arrows, 78
Arrows, 77
Arrows, 78
Arrows, 78
Arrows, 77
Arrows, 77
Arrows, 77
Arrows, 23
Arrows, 142
Arrows, 39
Arrows, 78
Arrows, 78
Arrows, 77
Arrows, 78
Arrows, 77
Arrows, 77
Arrows, 77
Arrows, 77
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 22
Arrows, 98
Arrows, 98
Arrows, 98
Arrows, 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 77
Context relation 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, (weak bisimularity) 27
Equivalences, (weak bisimularity) 27
Equivalences, (isomorphism), extended safe nets 100
Equivalences, (isomorphism), extended trans, systems 63
Equivalences, (isomorphism), transition systems 22
Equivalences, , (isomorphism), extended safe nets 100
Equivalences, , (isomorphism), extended trans, systems 63
Equivalences, , (isomorphism), transition systems 22
Equivalences, (abs. syntactic identity) 9
Equivalences, (abs. syntactic identity) 9
Equivalences, (syntactic equality) 10
Equivalences, (syntactic equality) 10
Equivalences, 25
Equivalences, (strong bisimularity), extended trans, systems 63
Equivalences, (strong bisimularity), transition systems 25
Equivalences, 25
Equivalences, (divergence) 27
Equivalences, (divergence) 27
Equivalences, (failure) 27
Equivalences, (failure) 27
Equivalences, (testing) 27
Equivalences, (testing) 27
Equivalences, (trace) 27
Equivalences, (trace) 27
Equivalences, (bisimulation congr.) 27
Equivalences, (bisimulation congr.) 27
Equivalences, ( -congruence) 10
Equivalences, ( -congruence) 10
Equivalences, 25
Equivalences, 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 78
Hot context relation 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
Реклама