|
|
|
|
| LEADER |
02591nam a2200313 a 4500 |
| 001 |
c000162375 |
| 003 |
CARM |
| 005 |
19950111000000.0 |
| 008 |
920615s1992 gw a 001 0 eng |
| 019 |
1 |
|
|a 9110749
|5 LACONCORD2021
|
| 020 |
|
|
|a 0387557679
|b (U.S. : alk. paper)
|
| 020 |
|
|
|a 3540557679
|b (Berlin : alk. paper)
|
| 035 |
|
|
|a (OCoLC)26130417
|5 LACONCORD2021
|
| 040 |
|
|
|a TOC
|b eng
|c TOC
|d TOC
|
| 050 |
|
0 |
|a QA76.58
|b .V63 1992
|
| 082 |
0 |
0 |
|a 005.1/2/028
|2 20
|
| 100 |
1 |
|
|a Vogler, W.
|q (Walter),
|d 1955-
|
| 245 |
1 |
0 |
|a Modular construction and partial order semantics of Petri nets /
|c W. Vogler.
|
| 260 |
|
|
|a Berlin ;
|a New York :
|b Springer-Verlag,
|c c1992.
|
| 300 |
|
|
|a viii, 252 p. :
|b ill. ;
|c 24 cm.
|
| 440 |
|
0 |
|a Lecture notes in computer science ;
|v 625.
|
| 504 |
|
|
|a Includes bibliographical references (p. [241]-249) and index.
|
| 505 |
0 |
|
|a 1. Introduction -- 2. Petri Nets and Their Semantics. 2.1. Basic notions of Petri nets. 2.2. Partial order semantics of nets. 2.3. Branching-time semantics of nets -- 3. Parallel Composition and Deadlocking. 3.1. Parallel composition with synchronization. 3.2. External equivalences based on deadlocking and divergence. 3.3. Modifications of failure semantics. 3.3.1. Modifications for safe nets. 3.3.2. Modifications for reachability and liveness. 3.3.3. Further modifications. 3.4. Further operators and congruence results -- 4. Behaviour Preserving Refinement of Places and Transitions. 4.1. Refinement techniques. 4.2. Deterministic nets and the refinement of places. 4.3. Composition by merging places. 4.4. I,O-nets and the refinement of transitions -- 5. Action Refinement and Interval Words. 5.1. Introduction to action refinement. 5.2. A technique of action refinement. 5.3. Action refinement and linear-time semantics. 5.4. A closer look at interval words.
|
| 505 |
0 |
|
|a 5.5. Comparison of interval words and interval semiwords -- 6. Action Refinement and Bisimulation. 6.1. Partial orders and bisimulation. 6.2. Event structures and action refinement. 6.3. Congruence results for ST-bisimulations. 6.4. History-preserving and OM-bisimulation -- 7. Partial Order Semantics for Nets with Capacities. 7.1. Compositionality. 7.2. Complementation-invariance and capacity-orientation. 7.3. S-modification.
|
| 650 |
|
0 |
|a Parallel processing (Electronic computers)
|
| 650 |
|
0 |
|a Petri nets.
|
| 852 |
8 |
|
|b CARM
|h A2:AM07E0
|i C05492
|p 0214331
|f BK
|
| 999 |
f |
f |
|i 5c5e84de-2239-539d-a951-5b99c5207efb
|s 51390be0-4be3-5a16-aa49-1d694ab5b4fe
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e C05492
|f A2:AM07E0
|h Other scheme
|i book
|m 0214331
|