HOME > Detail View

Detail View

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems (Loan 1 times)

Material type
단행본
Personal Author
Manna, Zohar. Pnueli, A.
Title Statement
The temporal logic of reactive and concurrent systems / Zohar Manna, Amir Pnueli.
Publication, Distribution, etc
New York :   Springer-Verlag ,   c1992-.  
Physical Medium
v. : ill. ; 25 cm.
ISBN
0387976647 (New York : v. 1) 3540976647 (Berlin : v. 1)
Content Notes
[1] Specification.
Bibliography, Etc. Note
Includes bibliographical references and indexes.
Subject Added Entry-Topical Term
Computer programming. Logic, Symbolic and mathematical.
000 00939camuu2200289 a 4500
001 000045310061
005 20061128131050
008 910719m19929999nyua b 001 0 eng
010 ▼a 91028181
020 ▼a 0387976647 (New York : v. 1)
020 ▼a 3540976647 (Berlin : v. 1)
035 ▼a (KERIS)REF000004839299
040 ▼a DLC ▼c DLC ▼d DLC ▼d 211009
050 0 0 ▼a QA76.6 ▼b .M3564 1991
082 0 0 ▼a 005.1 ▼2 20
090 ▼a 005.1 ▼b M282t
100 1 ▼a Manna, Zohar.
245 1 4 ▼a The temporal logic of reactive and concurrent systems / ▼c Zohar Manna, Amir Pnueli.
260 ▼a New York : ▼b Springer-Verlag , ▼c c1992-.
300 ▼a v. : ▼b ill. ; ▼c 25 cm.
504 ▼a Includes bibliographical references and indexes.
505 1 ▼a [1] Specification.
650 0 ▼a Computer programming.
650 0 ▼a Logic, Symbolic and mathematical.
700 1 ▼a Pnueli, A.
945 ▼a KINS

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 005.1 M282t 1 Accession No. 121134823 Availability Available Due Date Make a Reservation Service B M

Contents information

Table of Contents


CONTENTS
Preface = xii
Part Ⅰ Models of Concurrency = 1
Chapter l Basic Models = 3
 1.1 The Generic Model = 5
 1.2 Model 1 : Transition Diagrams = 12
 1.3 Model 2 : Shared-Variables Text = 21
 1.4 Semantics of Shared-Variables Text = 33
 1.5 Structural Relations Between Statements = 40
 1.6 Behavioral Equivalence = 44
 1.7 Grouped Statements = 52
 1.8 Semaphore Statements = 56
 1.9 Region Statements = 66
 1.10 Mode1 3 : Message-Passing Text = 70
 1.l1 Mode1 4 : Petri Nets = 86
 Problems = 93
 Bibliographic Notes = 100
Chapter 2 Modeling Real Concurrency = 103
 2.1 Interleaving and Concurrency = 104
 2.2 Limiting the Critical References = 108
 2.3 Justice(Weak Fairness) = 125
 2.4 Implication of the Justice Requirements = 131
 2.5 Compassion(Strong Fairness) = 139
 2.6 Synchronization Statements = 143
 2.7 Communication Statements = 144
 2.8 Summary : Fair Transition Systems = 148
 2.9 Fairness in Petri Nets = 151
 2.10 Semantic Considerations of Fairness = 153
 Problems = 159
 Bibliographic Notes = 173
Part Ⅱ Specifications = 177
Chapter 3 Temporal Logic = 179
 3.1 State Formulas = 150
 3.2 Temporal Formulas :Future Operators = 186
 3.3 Temporal Formulas :Past Operators = 192
 3.4 Basic Properties of the Temporal Operators = 201
 3.5 A Proof System = 214
 3.6 Axioms for a Proof System = 217
 3.7 Basic Inference Rules = 221
 3.8 Derived Inference Rules = 225
 3.9 Equality and Quantifiers = 233
 3.10 From General Validity to Program Validity = 245
 Problems = 258
 Bibliographic Notes = 268
Chapter 4 Properties of Programs = 275
 4.1 The Local Language = 275
 4.2 The Classification of Properties = 281
 4.3 Examples of Safety :State Invariances = 306
 4.4 Examples of Safety :Past Invariances = 313
 4.5 Examples of Progress Properties :From Guarantee to Reactivity = 321
 4.6 Example :A Resource Allocator = 329
 4.7 Expressivity of the Specification Language = 337
 4.8 Specification of Reactive Modules = 344
 4.9 Composing Modular Specifications = 354
 Problems = 371
 Bibliographic Notes = 384
References = 389
Index to Symbols = 403
General Index = 409


New Arrivals Books in Related Fields

Ramamurthy, Bina (2021)