close
1.

電子ブック
ＥＢ
1. Graph Transformations
Hartmut Ehrig, Reiko Heckel, Takeo Kanade, Grzegorz Rozenberg, Gabriele Taentzer
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
2.

電子ブック
ＥＢ
2. Unconventional Computing
Cristian S. Calude, Jos? F?lix Costa, Rudolf Freund, Takeo Kanade, Marion Oswald, Grzegorz Rozenberg
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
3.

電子ブック
ＥＢ
3. Graph Transformations
Hartmut Ehrig, Reiko Heckel, Takeo Kanade, Grzegorz Rozenberg, Gabriele Taentzer
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
4.

電子ブック
ＥＢ
4. Temporal Logic and State Systems
Fred Kröger, Wilfried Brauer, Juraj Hromkovic, Stephan Merz, Grzegorz Rozenberg
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface
Basic Concepts and Notions of Logics / 1：
Logical Languages, Semantics, and Formal Systems / 1.1：
Classical First-Order Logic / 1.2：
Theories and Models / 1.3：
Extensions of Logics / 1.4：
Bibliographical Notes
Basic Propositional Linear Temporal Logic / 2：
The Basic Language and Its Normal Semantics / 2.1：
Temporal Logical Laws / 2.2：
Axiomatization / 2.3：
Completeness / 2.4：
Decidability / 2.5：
Initial Validity Semantics / 2.6：
Extensions of LTL / 3：
Binary Temporal Operators / 3.1：
Fixpoint Operators / 3.2：
Propositional Quantification / 3.3：
Past Operators / 3.4：
Syntactic Anchoring / 3.5：
Combinations of Extensions / 3.6：
Expressiveness of Propositional Linear Temporal Logics / 4：
LTL and Its Extensions / 4.1：
Temporal Logic and Classical First-Order Logic / 4.2：
Non-deterministic w-Automata / 4.3：
LTL and Buchi Automata / 4.4：
Weak Alternating Automata / 4.5：
First-Order Linear Temporal Logic / 5：
Basic Language and Semantics / 5.1：
A Formal System / 5.2：
Incompleteness / 5.3：
Primed Individual Constants / 5.4：
Well-Founded Relations / 5.5：
Flexible Quantification / 5.6：
State Systems / 6：
Temporal Theories and Models / 6.1：
State Transition Systems / 6.2：
Rooted Transition Systems / 6.3：
Labeled Transition Systems / 6.4：
Fairness / 6.5：
Verification of State Systems / 7：
System Properties / 7.1：
Invariance Properties / 7.2：
Precedence Properties / 7.3：
Eventuality Properties / 7.4：
A Self-stabilizing Network / 7.5：
The Alternating Bit Protocol / 7.6：
Verification of Concurrent Programs / 8：
Programs as State Transition Systems / 8.1：
Shared-Variables Programs / 8.2：
Program Properties / 8.3：
A Mutual Exclusion Program / 8.4：
Message Passing Programs / 8.5：
A Producer-Consumer Program / 8.6：
Structured Specification / 9：
Refinement and Stuttering Invariance / 9.1：
Basic TLA / 9.2：
Generalized TLA / 9.3：
System Verification with GTLA / 9.4：
Hiding of Internal System Variables / 9.5：
Composition of System Components / 9.6：
Other Temporal Logics / 10：
Further Modifications of Linear Temporal Logic / 10.1：
Interval Temporal Logics / 10.2：
Branching Time Temporal Logics / 10.3：
The Logics CTL and CTL* / 10.4：
Temporal Logics for True Concurrency Modeling / 10.5：
System Verification by Model Checking / 11：
Finite State Systems / 11.1：
LTL Model Checking / 11.2：
CTL Model Checking / 11.3：
Fairness Constraints / 11.4：
Symbolic CTL Model Checking / 11.5：
Further Model Checking Techniques / 11.6：
List of Temporal Logical Laws
References
Index
Preface
Basic Concepts and Notions of Logics / 1：
Logical Languages, Semantics, and Formal Systems / 1.1：
5.

電子ブック
ＥＢ
5. Time-Dependent Scheduling
Stanislaw Gawiejnowicz, Wilfried Brauer, Juraj HromkoviÄ≥, Grzegorz Rozenberg
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Fundamentals / Part I：
Preliminaries / 1：
Mathematical notation / 1.1：
Sets and vectors / 1.1.1：
Sequences / 1.1.2：
Functions / 1.1.3：
Logical notation / 1.1.4：
Other notation / 1.1.5：
Basic definitions and results / 1.2：
Bibliographic notes / 1.3：
Problems and algorithms / 2：
Decision and optimization problems / 2.1：
Encoding schemata / 2.1.1：
Undecidable and decidable problems / 2.1.2：
Basic concepts related to algorithms / 2.2：
Time and space complexity of algorithms / 2.2.1：
Polynomial-time algorithms / 2.2.2：
Exponential-time algorithms / 2.2.3：
Pseudopolynomial-time algorithms / 2.2.4：
Exact algorithms / 2.2.5：
Enumerative algorithms / 2.2.6：
Branch-and-bound algorithms / 2.2.7：
Dynamic programming algorithms / 2.2.8：
Approximation algorithms / 2.2.9：
Approximation schemata / 2.2.10：
Offline algorithms vs. online algorithms / 2.2.11：
Heuristic algorithms / 2.2.12：
Greedy algorithms / 2.2.13：
Local search algorithms / 2.2.14：
Metaheuristics / 2.2.15：
The presentation of algorithms / 2.2.16：
NP-complete problems / 2.3：
Examples of NP-complete problems / 3.1：
Basics of the scheduling theory / 3.3：
Parameters of the scheduling problem / 4.1：
Parameters of the set of jobs / 4.1.1：
Parameters of the set of machines / 4.1.2：
Parameters of the set of resources / 4.1.3：
The notion of schedule / 4.2：
The presentation of schedules / 4.2.1：
Parameters characterizing a job in schedule / 4.2.2：
Types of schedules / 4.2.3：
The criteria of schedule optimality / 4.3：
Notation of scheduling problems / 4.4：
Basics of time-dependent scheduling / 4.5：
The scheduling theory vs. time-dependent scheduling / 5.1：
Scheduling multiprocessor tasks / 5.1.1：
Scheduling on machines with variable processing speeds / 5.1.2：
Scheduling jobs with variable processing times / 5.1.3：
Formulation of time-dependent scheduling problems / 5.2：
Terminology and notation / 5.3：
Applications of time-dependent scheduling / 5.4：
Scheduling problems with deteriorating job processing times / 5.4.1：
Scheduling problems with shortening job processing times / 5.4.2：
Other examples of time-dependent scheduling problems / 5.4.3：
Scheduling problems with time-dependent parameters / 5.4.4：
Complexity / 5.5：
Single-machine time-dependent scheduling / 6：
Minimizing the maximum completion time / 6.1：
Proportional deterioration / 6.1.1：
Proportional-linear deterioration / 6.1.2：
Linear deterioration / 6.1.3：
Simple non-linear deterioration / 6.1.4：
General non-linear deterioration / 6.1.5：
Proportional-linear shortening / 6.1.6：
Linear shortening / 6.1.7：
Non-linear shortening / 6.1.8：
Minimizing the total completion time / 6.2：
Minimizing the maximum lateness / 6.2.1：
Other criteria / 6.3.1：
Summary and tables / 6.4.1：
Parallel-machine time-dependent scheduling / 7：
Dedicated-machine time-dependent scheduling / 7.1：
Algorithms / 8.1：
Approximation and heuristic algorithms / 9：
General non-linear shortening / 9.1：
Concluding remarks / 9.2：
Greedy algorithms based on signatures / 10：
Problem formulation / 10.1：
Definition of signatures / 10.1.2：
Basic properties of signatures / 10.2：
A greedy algorithm / 10.3：
Signatures of regular sequences / 10.4：
Sequences of consecutive natural numbers / 10.4.1：
Arithmetic sequences / 10.4.2：
Geometric sequences / 10.4.3：
Arbitrary sequences / 10.4.4：
Basic definitions / 10.5：
General concepts in local search / 11.1.2：
Applicability of local search algorithms / 11.1.3：
Selected types of local search algorithms / 11.2：
Iterative improvement algorithms / 11.2.1：
Steepest descent search algorithms / 11.2.2：
Simulated annealing algorithms / 11.2.3：
Genetic and evolutionary algorithms / 11.2.4：
Local search time-dependent scheduling algorithms / 11.3：
Experimental evaluation of algorithms H[subscript 54] and H[subscript 58] / 11.3.1：
Evolutionary algorithms / 11.3.4：
Advanced Topics / 11.4：
Matrix methods in time-dependent scheduling / 12：
Notation / 12.1：
Auxiliary result / 12.1.3：
A matrix approach / 12.2：
The matrix form of single-machine schedules / 12.2.1：
The matrix form of parallel-machine schedules / 12.2.2：
The l[subscript p] norm criterion / 12.3：
Results / 12.3.1：
Equivalent problems / 12.4：
The initial problem / 12.4.1：
The transformed problem / 12.4.2：
Detailed results / 12.4.3：
Concluding remarks and open problems / 12.5：
Scheduling dependent deteriorating jobs / 13：
Chain precedence constraints / 13.1：
Tree and forest precedence constraints / 13.3：
Series-parallel constraints / 13.4：
General precedence constraints / 13.5：
Time-dependent scheduling with two criteria / 13.6：
Problems formulation / 14.1：
Preliminary results / 14.1.2：
Pareto optimality / 14.2：
Scalar optimality / 14.3：
Computational experiments / 14.4：
Afterword / 14.5：
References
List of Figures
List of Tables
Author Index
Subject Index
Symbol Index
Fundamentals / Part I：
Preliminaries / 1：
Mathematical notation / 1.1：
6.

電子ブック
ＥＢ
6. Unconventional Computing
Cristian S. Calude, José Félix Costa, Rudolf Freund, Takeo Kanade, Marion Oswald, Grzegorz Rozenberg, Jose Felix Gomes da Costa
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼