Modeling and verification of real-time systems: formalisms and software tools
Saved in:
| Other Authors: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
London
ISTE [u.a.]
2008
|
| Edition: | 1. publ. |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | 393 S. graph. Darst. |
| ISBN: | 9781848210134 |
Staff View
MARC
| LEADER | 00000nam a22000002c 4500 | ||
|---|---|---|---|
| 001 | BV022958624 | ||
| 003 | DE-604 | ||
| 005 | 20090219 | ||
| 007 | t | ||
| 008 | 071112s2008 d||| |||| 00||| eng d | ||
| 020 | |a 9781848210134 |9 978-1-84821-013-4 | ||
| 035 | |a (OCoLC)180190932 | ||
| 035 | |a (DE-599)BSZ263451909 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-824 |a DE-703 |a DE-11 | ||
| 050 | 0 | |a QA76.54 | |
| 082 | 0 | |a 004.01/51 |2 22 | |
| 084 | |a ST 170 |0 (DE-625)143602: |2 rvk | ||
| 084 | |a ST 234 |0 (DE-625)143621: |2 rvk | ||
| 245 | 1 | 0 | |a Modeling and verification of real-time systems |b formalisms and software tools |c ed. by Stephan Merz ... |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a London |b ISTE [u.a.] |c 2008 | |
| 300 | |a 393 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Computer software |x Verification | |
| 650 | 4 | |a Formal methods (Computer science) | |
| 650 | 4 | |a Real-time data processing | |
| 650 | 0 | 7 | |a Echtzeitsystem |0 (DE-588)4131397-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Echtzeitverarbeitung |0 (DE-588)4151002-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Echtzeitverarbeitung |0 (DE-588)4151002-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Echtzeitsystem |0 (DE-588)4131397-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Merz, Stephan |4 edt | |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016163019&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016163019 | ||
Record in the Search Index
| _version_ | 1804137204237205504 |
|---|---|
| adam_text | Contents
Preface
......................................... 15
Stephan Merz and Nicolas
Navet
Chapter
1. Time
Petri
Nets
-
Analysis Methods and Verification
with TINA
...................................... 19
Bernard Berthomieu,
Florent PERES
and
François Vernadat
1.1.
Introduction
.................................. 19
1.2.
Time
Petri
nets
................................ 20
1.2.1.
Definition
................................ 20
1.2.2.
States and the state reachability relation
............... 20
1.2.3.
Illustration
............................... 22
1.2.4.
Some general theorems
........................ 23
1.3.
State class graphs preserving markings and LTL properties
....... 24
1.3.1.
State classes
............................... 24
1.3.2.
Illustration
............................... 25
1.3.3.
Checking the boundedness property on-the-fly
........... 26
1.3.4.
Variations
................................ 27
1.3.4.1.
Multiple enabledness
...................... 27
1.3.4.2.
Preservation of markings (only)
................ 28
1.4.
State class graphs preserving states and LTL properties
......... 28
1.4.1.
Clock domain
.............................. 28
1.4.2.
Construction of the SSCG
...................... 29
1.4.3.
Variants
................................. 30
1.5.
State class graphs preserving states and branching properties
...... 32
1.6.
Computing firing schedules
......................... 33
1.6.1.
Schedule systems
............................ 33
1.6.2.
Delays (relative dates) versus dates (absolute)
........... 34
1.6.3.
Illustration
............................... 35
1.7.
An implementation: the Tina environment
................ 35
6
Modeling and Verification of Real-Time Systems
1.8.
The verification of
SE
-LTL formulae in Tina
............. 37
1.8.1.
The temporal logic SE-LTL
.................... 37
1.8.2.
Preservation of LTL properties by
tina
constructions
...... 39
1.8.3. seit:
the
SE-
LTL checker of Tina
............... 39
1.8.3.1.
Verification technique
...................... 39
1.8.3.2.
The
seit
logic
......................... 40
1.9.
Some examples of use of
seit....................... 42
1.9.1.
John and Fred
.............................. 42
1.9.1.1.
Statement of problem
...................... 42
1.9.1.2.
Are the temporal constraints appearing in this scenario
consistent?
............................ 42
1.9.1.3.
Is it possible that Fred took the bus and John the
carpool?
. . 44
1.9.1.4.
At which time could Fred have left home?
.......... 44
1.9.2.
The alternating bit protocol
...................... 44
1.10.
Conclusion
.................................. 47
1.11.
Bibliography
................................. 48
Chapter
2.
Validation of Reactive Systems by Means of Verification
and Conformance Testing
............................. 51
Camille
Constant, Thierry
Jéron, Hervé Marchand
and
Vlád Rusu
2.1.
Introduction
.................................. 51
2.2.
The IOSTS model
.............................. 54
2.2.1.
Syntax of IOSTS
............................ 54
2.2.2.
Semantics of IOSTS
.......................... 56
2.3.
Basic operations on IOSTS
......................... 57
2.3.1.
Parallel product
............................. 57
2.3.2.
Suspension
............................... 58
2.3.3.
Deterministic IOSTS and determinization
.............. 60
2.4.
Verification and conformance testing with IOSTS
............ 60
2.4.1.
Verification
............................... 60
2.4.1.1.
Verifying safety properties
................... 62
2.4.1.2.
Verifying possibility properties
................. 63
2.4.1.3.
Combining observers
...................... 63
2.4.2.
Conformance testing
.......................... 64
2.5.
Test generation
................................ 64
2.6.
Test selection
................................. 68
2.7.
Conclusion and related work
........................ 70
2.8.
Bibliography
................................. 73
Chapter
3.
An Introduction to Model Checking
................ 77
Stephan Merz
3.1.
Introduction
.................................. 77
3.2.
Example: control of an elevator
....................... 78
Contents 7
3.3. Transition
systems and invariant checking
................. 79
3.3.1.
Transition systems and their runs
................... 81
3.3.2.
Verification of invariants
........................ 82
3.4.
Temporal logic
................................ 84
3.4.1.
Linear-time temporal logic
...................... 84
3.4.2.
Branching-time temporal logic
.................... 87
3.4.3.
ω
-automata
...............................
89
3.4.4.
Automata and PTL
........................... 92
3.5.
Model checking algorithms
......................... 94
3.5.1.
Local PTL model checking
...................... 95
3.5.2.
Global CTL model checking
..................... 97
3.5.3.
Symbolic model checking algorithms
................ 99
3.6.
Some research topics
............................. 103
3.7.
Bibliography
................................. 105
Chapter
4.
Model Checking Timed Automata
.................
Ill
Patricia Bouyer and
François Laroussinie
4.1.
Introduction
..................................
Ill
4.2.
Timed automata
................................ 112
4.2.1.
Some notations
............................. 112
4.2.2.
Timed automata, syntax and semantics
............... 113
4.2.3.
Parallel composition
.......................... 114
4.3.
Decision procedure for checking reachability
............... 115
4.4.
Other verification problems
......................... 118
4.4.1.
Timed languages
............................
П8
4.4.2.
Branching-time timed logics
..................... 118
4.4.3.
Linear-time timed logics
........................ 120
4.4.4.
Timed modal logics
.......................... 121
4.4.5.
Testing automata
............................ 121
4.4.6.
Behavioral equivalences
........................ 121
4.5.
Some extensions of timed automata
.................... 121
4.5.1.
Diagonal clock constraints
...................... 122
4.5.2.
Additive clock constraints
....................... 123
4.5.3.
Internal actions
............................. 124
4.5.4.
Updates of clocks
........................... 25
4.5.5.
Linear hybrid automata
........................ 126
4.6.
Subclasses of timed automata
........................ 127
4.6.1.
Event-recording automata
....................... 127
4.6.2.
One-clock timed automata
....................... 128
4.6.3.
Discrete-time models
......................... 129
4.7.
Algorithms for timed verification
...................... 130
4.7.1.
A symbolic representation for timed automata: the zones
..... 130
4.7.2.
Backward analysis in timed automata
................ 131
8
Modeling and Verification of Real-Time Systems
4.7.3.
Forward analysis of timed automata
................. 132
4.7.4.
A data structure for timed systems: DBMs
............. 133
4.8.
The model-checking tool Uppaal
...................... 134
4.9.
Bibliography
................................. 135
Chapter
5.
Specification and Analysis of Asynchronous Systems
using CADP
..................................... 141
Radu Mateescu
5.1.
Introduction
.................................. 141
5.2.
The CADP toolbox
.............................. 142
5.2.1.
The LOTOS language
......................... 143
5.2.2.
Labeled transition systems
...................... 143
5.2.3.
Some verification tools
........................ 144
5.3.
Specification of a drilling unit
........................ 147
5.3.1.
Architecture
............................... 150
5.3.2.
Physical devices and local controllers
................ 152
5.3.2.1.
Turning table
........................... 152
5.3.2.2.
Clamp
............................... 153
5.3.2.3.
Drill
................................ 154
5.3.2.4.
Tester
............................... 154
5.3.3.
Main controller
-
sequential version
................. 155
5.3.4.
Main controller
-
parallel version
.................. 157
5.3.5.
Environment
.............................. 158
5.4.
Analysis of the functioning of the drilling unit
.............. 159
5.4.1.
Equivalence checking
......................... 159
5.4.2.
Model checking
............................ 161
5.5.
Conclusion and future work
......................... 164
5.6.
Bibliography
................................. 166
Chapter
6.
Synchronous Program Verification with
Lustre/Lesar
..... 171
Pascal Raymond
6.1.
Synchronous approach
............................ 171
6.1.1.
Reactive systems
............................ 171
6.1.2.
The synchronous approach
...................... 172
6.1.3.
Synchronous languages
........................ 172
6.2.
The Lustre language
............................. 173
6.2.1.
Principles
................................ 173
6.2.2.
Example: the beacon counter
..................... 174
6.3.
Program verification
............................. 174
6.3.1.
Notion of temporal property
...................... 175
6.3.2.
Safety and liveness
........................... 175
6.3.3.
Beacon counter properties
....................... 175
6.3.4.
State machine
.............................. 175
Contents 9
6.3.5.
Explicit
automata
............................ 176
6.3.6.
Principles of model checking
..................... 176
6.3.7.
Example of abstraction
........................ 177
6.3.8.
Conservative abstraction and safety
................. 178
6.4.
Expressing properties
............................ 178
6.4.1.
Model checking: general scheme
................... 178
6.4.2.
Model checking synchronous program
................ 179
6.4.3.
Observers
................................ 180
6.4.4.
Examples
................................ 180
6.4.5.
Hypothesis
............................... 180
6.4.6.
Model checking of synchronous programs
............. 181
6.5.
Algorithms
.................................. 182
6.5.1.
Boolean automaton
........................... 182
6.5.2.
Explicit automaton
........................... 182
6.5.3.
The
pre
and post
functions
................... 183
6.5.4.
Outstanding states
........................... 183
6.5.5.
Principles of the exploration
..................... 184
6.6.
Enumerative algorithm
............................ 184
6.7.
Symbolic methods and binary decision diagrams
............. 185
6.7.1.
Notations
................................ 185
6.7.2.
Handling predicates
.......................... 186
6.7.3.
Representation of the predicates
................... 186
6.7.3.1.
Shannon s decomposition
.................... 186
6.7.3.2.
Binary decision diagrams
.................... 187
6.7.4.
Typical interface of a BDD library
.................. 188
6.7.5.
Implementation of BDDs
....................... 188
6.7.6.
Operations on BDDs
.......................... 189
6.7.6.1.
Negation
............................. 189
6.7.6.2.
Binary operators
......................... 189
6.7.6.3.
Cofactors and quantifiers
.................... 190
6.7.7.
Notes on complexity
.......................... 191
6.7.8.
Typed decision diagrams
....................... 192
6.7.8.1.
Positive functions
........................ 192
6.7.8.2.
TDG
................................ 192
6.7.8.3.
TDG implementation
...................... 193
6.7.8.4.
Interest in TDGs
......................... 193
6.7.9.
Care set and generalized cofactor
................... 194
6.7.9.1.
Knowing that operators
.................... 194
6.7.9.2.
Generalized cofactor
....................... 194
6.7.9.3.
Restriction
............................ 194
6.7.9.4.
Algebraic properties of the generalized cofactor
....... 195
6.8.
Forward symbolic exploration
........................ 195
6.8.1.
General scheme
............................. 196
10
Modeling and Verification of
Real-Time
Systems
6.8.2.
Detailed implementation
........................ 196
6.8.3.
Symbolic image computing
...................... 198
6.8.4.
Optimized image computing
..................... 198
6.8.4.1.
Principles
............................. 198
6.8.4.2.
Universal image
......................... 199
6.8.4.3.
Case of a single transition function
............... 199
6.8.4.4.
Shannon s decomposition of the image
............ 200
6.9.
Backward symbolic exploration
....................... 201
6.9.1.
General scheme
............................. 201
6.9.2.
Reverse image computing
....................... 202
6.9.3.
Comparing forward and backward methods
............. 203
6.10.
Conclusion and related works
....................... 203
6.11.
Demonstrations
............................... 204
6.12.
Bibliography
................................. 205
Chapter
7.
Synchronous Functional Programming with Lucid
Synchrone
207
Paul
Caspi,
Grégoire
Hamon and Marc POUZET
7.1.
Introduction
.................................. 207
7.1.1.
Programming reactive systems
.................... 207
7.1.1.1.
The synchronous languages
................... 208
7.1.1.2.
Model-based design
....................... 210
7.1.1.3.
Converging needs
........................ 211
7.1.2.
Lucid
Synchrone............................ 211
7.2.
Lucid
Synchrone............................... 213
7.2.1.
An ML dataflow language
....................... 213
7.2.1.1.
Infinite streams as basic objects
................ 213
7.2.1.2.
Temporal operations: delay and initialization
......... 213
7.2.2.
Stream functions
............................ 214
7.2.3.
Multi-sampled systems
........................ 216
7.2.3.1.
The sampling operator when
.................. 217
7.2.3.2.
The combination operator merge
............... 218
7.2.3.3.
Oversampling
........................... 219
7.2.3.4.
Clock constraints and synchrony
................ 220
7.2.4.
Static values
............................... 222
7.2.5.
Higher-order features
......................... 222
7.2.6.
Datatypes and pattern matching
.................... 224
7.2.7.
A programming construct to share the memory
........... 225
7.2.8.
Signals and signal patterns
...................... 227
7.2.8.1.
Signals as clock abstractions
.................. 227
7.2.8.2.
Testing presence and pattern matching over signals
..... 228
7.2.9.
State machines and mixed designs
.................. 229
7.2.9.1.
Weak and strong preemption
.................. 229
7.2.9.2.
ABRO
and modular reset
.................... 230
Contents 11
7.2.9.3.
Local definitions to a state
................... 231
7.2.9.4.
Communication between states and shared memory
..... 232
7.2.9.5.
Resume or reset a state
..................... 233
7.2.10.
Parametrized state machines
..................... 233
7.2.11.
Combining state machines and signals
............... 234
7.2.12.
Recursion and non-real-time features
................ 236
7.2.13.
Two classical examples
........................ 236
7.2.13.1.
The inverted pendulum
..................... 236
7.2.13.2.
A heater
............................. 237
7.3.
Discussion
................................... 240
7.3.1.
Functional reactive programming and circuit description languages
240
7.3.2.
Lucid
Synchrone
as a prototyping language
............. 241
7.4.
Conclusion
.................................. 242
7.5.
Acknowledgment
............................... 243
7.6.
Bibliography
................................. 243
Chapter
8.
Verification of Real-Time Probabilistic Systems
......... 249
Marta
Kwiatkowska, Gethin Norman, David Parker
and Jeremy Sproston
8.1.
Introduction
.................................. 249
8.2.
Probabilistic timed automata
........................ 250
8.2.1.
Preliminaries
.............................. 250
8.2.2.
Syntax of probabilistic timed automata
............... 252
8.2.3.
Modeling with probabilistic timed automata
............ 254
8.2.4.
Semantics of probabilistic timed automata
............. 254
8.2.5.
Probabilistic reachability and
invariance
............... 255
8.3.
Model checking for probabilistic timed automata
............. 258
8.3.1.
The region graph
............................ 258
8.3.2.
Forward symbolic approach
...................... 261
8.3.2.1.
Symbolic state operations
.................... 261
8.3.2.2.
Computing maximum reachability probabilities
....... 263
8.3.3.
Backward symbolic approach
..................... 266
8.3.3.1.
Symbolic state operations
.................... 266
8.3.3.2.
Probabilistic until
........................ 267
8.3.3.3.
Computing maximum reachability probabilities
....... 268
8.3.3.4.
Computing minimum reachability probabilities
........ 270
8.3.4.
Digital clocks
.............................. 273
8.3.4.1.
Expected reachability
...................... 274
8.3.4.2.
Integral semantics
........................ 276
8.4.
Case study: the
ШЕЕ
FireWire
root contention protocol
......... 277
8.4.1.
Overview
................................ 277
8.4.2.
Probabilistic timed automata model
................. 278
8.4.3.
Model checking statistics
....................... 281
12
Modeling and Verification of Real-Time Systems
8.4.4.
Performance analysis
......................... 282
8.5.
Conclusion
.................................. 285
8.6.
Bibliography
................................. 285
Chapter
9.
Verification of Probabilistic Systems Methods and Tools
.... 289
Serge Haddad and Patrice Moreaux
9.1.
Introduction
.................................. 289
9.2.
Performance evaluation of Markovian models
............... 290
9.2.1.
A stochastic model of discrete event systems
............ 290
9.2.2.
Discrete-time Markov chains
..................... 292
9.2.2.1.
Presentation
............................ 292
9.2.2.2.
Transient and steady-state behaviors of DTMC
........ 293
9.2.3.
Continuous-time Markov chains
................... 294
9.2.3.1.
Presentation
............................ 294
9.2.3.2.
Transient and steady-state behaviors of CTMC
........ 295
9.3.
High level stochastic models
........................ 297
9.3.1.
Stochastic
Petri
nets with general distributions
........... 297
9.3.1.1.
Choice policy
........................... 298
9.3.1.2.
Service policy
.......................... 298
9.3.1.3.
Memory policy
.......................... 298
9.3.2.
GLSPN with exponential distributions
................ 299
9.3.3.
Performance indices of
SPN
..................... 300
9.3.4.
Overview of models and methods in performance evaluation
. . . 300
9.3.5.
The GreatSPN tool
........................... 301
9.3.5.1.
Supported models
........................ 302
9.3.5.2.
Qualitative analysis of
Petri
nets
................ 302
9.3.5.3.
Performance analysis of stochastic
Petri
nets
......... 302
9.3.5.4.
Software architecture
...................... 302
9.4.
Probabilistic verification of Markov chains
................ 303
9.4.1.
Limits of standard performance indices
............... 303
9.4.2.
A temporal logic for Markov chains
................. 303
9.4.3.
Verification algorithms
......................... 305
9.4.4.
Overview of probabilistic verification of Markov chains
...... 306
9.4.5.
The ETMCC tool
............................ 307
9.4.5.1.
Language of system models
................... 307
9.4.5.2.
Language of properties
..................... 307
9.4.5.3.
Computed results
......................... 308
9.4.5.4.
Software architecture
...................... 308
9.5.
Markov decision processes
......................... 308
9.5.1.
Presentation of Markov decision processes
............. 308
9.5.2.
A temporal logic for Markov decision processes
.......... 309
9.5.3.
Verification algorithms
......................... 309
9.5.4.
Overview of verification of Markov decision processes
...... 313
Contents 13
9.5.5.
The PRISM tool
............................ 314
9.5.5.1.
Language of system models
................... 314
9.5.5.2.
Properties language
....................... 314
9.5.5.3.
Computed results
......................... 314
9.5.5.4.
Software architecture
...................... 314
9.6.
Bibliography
................................. 315
Chapter
10.
Modeling and Verification of Real-Time Systems
using the IF Toolset
................................. 319
Marius Bozga,
Susanne Graf,
Laurent Mounier and
Iulian
Ober
10.1.
Introduction
................................. 320
10.2.
Architecture
................................. 322
10.3.
The IF notation
............................... 324
10.3.1.
Functional features
.......................... 324
10.3.2.
Non-functional features
....................... 326
10.3.3.
Expressing properties with observers
................ 328
10.4.
The IF tools
................................. 329
10.4.1.
Core components
........................... 329
10.4.2.
Static analysis
............................. 332
10.4.3.
Validation
............................... 333
10.4.4.
Translating UML to IF
........................ 334
10.4.4.1.
UML modeling
......................... 334
10.4.4.2.
The principles of the mapping from UML to IF
....... 334
10.5.
An overview on uses of IF incase studies
................ 336
10.6.
Case study: the
Ariane 5
flight program
................. 337
10.6.1.
Overview of the
Ariane 5
flight program
.............. 337
10.6.2.
Verification of functional properties
................ 339
10.6.3.
Verification of non-functional properties
.............. 343
10.6.4.
Modular verification and abstraction
................ 344
10.7.
Conclusion
.................................. 345
10.8.
Bibliography
................................. 347
Chapter
11.
Architecture Description Languages: An Introduction
totheSAEAADL
.................................. 353
Anne-Marie DÉPLANCHE
and
Sébastien
FAUCOU
11.1.
Introduction
................................. 353
11.2.
Main characteristics of the architecture description languages
..... 356
11.3.
ADLs and real-time systems
........................ 357
11.3.1.
Requirement analysis
......................... 357
11.3.2.
Architectural views
.......................... 359
11.4.
Outline of related works
.......................... 360
11.5.
The AADL language
............................
362
11.5.1.
An overview of the AADL
...................... 363
14
Modeling and Verification of
Real-Time
Systems
11.6.
Case study
.................................. 365
11.6.1.
Requirements
............................. 365
11.6.2.
Architecture design and analysis with AADL
........... 366
11.6.2.1.
High-level design
........................ 366
11.6.2.2.
Thread and communication timing semantics
........ 369
11.6.2.3.
Technical overview of the flow latency analysis algorithm
. 373
11.6.2.4.
Modeling fault-tolerance mechanisms
............ 374
11.6.3.
Designing for reuse: package and refinement
........... 377
11.7.
Conclusion
.................................. 380
11.8.
Bibliography
................................. 381
List of Authors
.................................... 385
Index
.......................................... 389
|
| adam_txt |
Contents
Preface
. 15
Stephan Merz and Nicolas
Navet
Chapter
1. Time
Petri
Nets
-
Analysis Methods and Verification
with TINA
. 19
Bernard Berthomieu,
Florent PERES
and
François Vernadat
1.1.
Introduction
. 19
1.2.
Time
Petri
nets
. 20
1.2.1.
Definition
. 20
1.2.2.
States and the state reachability relation
. 20
1.2.3.
Illustration
. 22
1.2.4.
Some general theorems
. 23
1.3.
State class graphs preserving markings and LTL properties
. 24
1.3.1.
State classes
. 24
1.3.2.
Illustration
. 25
1.3.3.
Checking the boundedness property on-the-fly
. 26
1.3.4.
Variations
. 27
1.3.4.1.
Multiple enabledness
. 27
1.3.4.2.
Preservation of markings (only)
. 28
1.4.
State class graphs preserving states and LTL properties
. 28
1.4.1.
Clock domain
. 28
1.4.2.
Construction of the SSCG
. 29
1.4.3.
Variants
. 30
1.5.
State class graphs preserving states and branching properties
. 32
1.6.
Computing firing schedules
. 33
1.6.1.
Schedule systems
. 33
1.6.2.
Delays (relative dates) versus dates (absolute)
. 34
1.6.3.
Illustration
. 35
1.7.
An implementation: the Tina environment
. 35
6
Modeling and Verification of Real-Time Systems
1.8.
The verification of
SE
-LTL formulae in Tina
. 37
1.8.1.
The temporal logic SE-LTL
. 37
1.8.2.
Preservation of LTL properties by
tina
constructions
. 39
1.8.3. seit:
the
SE-
LTL checker of Tina
. 39
1.8.3.1.
Verification technique
. 39
1.8.3.2.
The
seit
logic
. 40
1.9.
Some examples of use of
seit. 42
1.9.1.
John and Fred
. 42
1.9.1.1.
Statement of problem
. 42
1.9.1.2.
Are the temporal constraints appearing in this scenario
consistent?
. 42
1.9.1.3.
Is it possible that Fred took the bus and John the
carpool?
. . 44
1.9.1.4.
At which time could Fred have left home?
. 44
1.9.2.
The alternating bit protocol
. 44
1.10.
Conclusion
. 47
1.11.
Bibliography
. 48
Chapter
2.
Validation of Reactive Systems by Means of Verification
and Conformance Testing
. 51
Camille
Constant, Thierry
Jéron, Hervé Marchand
and
Vlád Rusu
2.1.
Introduction
. 51
2.2.
The IOSTS model
. 54
2.2.1.
Syntax of IOSTS
. 54
2.2.2.
Semantics of IOSTS
. 56
2.3.
Basic operations on IOSTS
. 57
2.3.1.
Parallel product
. 57
2.3.2.
Suspension
. 58
2.3.3.
Deterministic IOSTS and determinization
. 60
2.4.
Verification and conformance testing with IOSTS
. 60
2.4.1.
Verification
. 60
2.4.1.1.
Verifying safety properties
. 62
2.4.1.2.
Verifying possibility properties
. 63
2.4.1.3.
Combining observers
. 63
2.4.2.
Conformance testing
. 64
2.5.
Test generation
. 64
2.6.
Test selection
. 68
2.7.
Conclusion and related work
. 70
2.8.
Bibliography
. 73
Chapter
3.
An Introduction to Model Checking
. 77
Stephan Merz
3.1.
Introduction
. 77
3.2.
Example: control of an elevator
. 78
Contents 7
3.3. Transition
systems and invariant checking
. 79
3.3.1.
Transition systems and their runs
. 81
3.3.2.
Verification of invariants
. 82
3.4.
Temporal logic
. 84
3.4.1.
Linear-time temporal logic
. 84
3.4.2.
Branching-time temporal logic
. 87
3.4.3.
ω
-automata
.
89
3.4.4.
Automata and PTL
. 92
3.5.
Model checking algorithms
. 94
3.5.1.
Local PTL model checking
. 95
3.5.2.
Global CTL model checking
. 97
3.5.3.
Symbolic model checking algorithms
. 99
3.6.
Some research topics
. 103
3.7.
Bibliography
. 105
Chapter
4.
Model Checking Timed Automata
.
Ill
Patricia Bouyer and
François Laroussinie
4.1.
Introduction
.
Ill
4.2.
Timed automata
. 112
4.2.1.
Some notations
. 112
4.2.2.
Timed automata, syntax and semantics
. 113
4.2.3.
Parallel composition
. 114
4.3.
Decision procedure for checking reachability
. 115
4.4.
Other verification problems
. 118
4.4.1.
Timed languages
.
П8
4.4.2.
Branching-time timed logics
. 118
4.4.3.
Linear-time timed logics
. 120
4.4.4.
Timed modal logics
. 121
4.4.5.
Testing automata
. 121
4.4.6.
Behavioral equivalences
. 121
4.5.
Some extensions of timed automata
. 121
4.5.1.
Diagonal clock constraints
. 122
4.5.2.
Additive clock constraints
. 123
4.5.3.
Internal actions
. 124
4.5.4.
Updates of clocks
. '25
4.5.5.
Linear hybrid automata
. 126
4.6.
Subclasses of timed automata
. 127
4.6.1.
Event-recording automata
. 127
4.6.2.
One-clock timed automata
. 128
4.6.3.
Discrete-time models
. 129
4.7.
Algorithms for timed verification
. 130
4.7.1.
A symbolic representation for timed automata: the zones
. 130
4.7.2.
Backward analysis in timed automata
. 131
8
Modeling and Verification of Real-Time Systems
4.7.3.
Forward analysis of timed automata
. 132
4.7.4.
A data structure for timed systems: DBMs
. 133
4.8.
The model-checking tool Uppaal
. 134
4.9.
Bibliography
. 135
Chapter
5.
Specification and Analysis of Asynchronous Systems
using CADP
. 141
Radu Mateescu
5.1.
Introduction
. 141
5.2.
The CADP toolbox
. 142
5.2.1.
The LOTOS language
. 143
5.2.2.
Labeled transition systems
. 143
5.2.3.
Some verification tools
. 144
5.3.
Specification of a drilling unit
. 147
5.3.1.
Architecture
. 150
5.3.2.
Physical devices and local controllers
. 152
5.3.2.1.
Turning table
. 152
5.3.2.2.
Clamp
. 153
5.3.2.3.
Drill
. 154
5.3.2.4.
Tester
. 154
5.3.3.
Main controller
-
sequential version
. 155
5.3.4.
Main controller
-
parallel version
. 157
5.3.5.
Environment
. 158
5.4.
Analysis of the functioning of the drilling unit
. 159
5.4.1.
Equivalence checking
. 159
5.4.2.
Model checking
. 161
5.5.
Conclusion and future work
. 164
5.6.
Bibliography
. 166
Chapter
6.
Synchronous Program Verification with
Lustre/Lesar
. 171
Pascal Raymond
6.1.
Synchronous approach
. 171
6.1.1.
Reactive systems
. 171
6.1.2.
The synchronous approach
. 172
6.1.3.
Synchronous languages
. 172
6.2.
The Lustre language
. 173
6.2.1.
Principles
. 173
6.2.2.
Example: the beacon counter
. 174
6.3.
Program verification
. 174
6.3.1.
Notion of temporal property
. 175
6.3.2.
Safety and liveness
. 175
6.3.3.
Beacon counter properties
. 175
6.3.4.
State machine
. 175
Contents 9
6.3.5.
Explicit
automata
. 176
6.3.6.
Principles of model checking
. 176
6.3.7.
Example of abstraction
. 177
6.3.8.
Conservative abstraction and safety
. 178
6.4.
Expressing properties
. 178
6.4.1.
Model checking: general scheme
. 178
6.4.2.
Model checking synchronous program
. 179
6.4.3.
Observers
. 180
6.4.4.
Examples
. 180
6.4.5.
Hypothesis
. 180
6.4.6.
Model checking of synchronous programs
. 181
6.5.
Algorithms
. 182
6.5.1.
Boolean automaton
. 182
6.5.2.
Explicit automaton
. 182
6.5.3.
The
"pre
"
and "post
"
functions
. 183
6.5.4.
Outstanding states
. 183
6.5.5.
Principles of the exploration
. 184
6.6.
Enumerative algorithm
. 184
6.7.
Symbolic methods and binary decision diagrams
. 185
6.7.1.
Notations
. 185
6.7.2.
Handling predicates
. 186
6.7.3.
Representation of the predicates
. 186
6.7.3.1.
Shannon's decomposition
. 186
6.7.3.2.
Binary decision diagrams
. 187
6.7.4.
Typical interface of a BDD library
. 188
6.7.5.
Implementation of BDDs
. 188
6.7.6.
Operations on BDDs
. 189
6.7.6.1.
Negation
. 189
6.7.6.2.
Binary operators
. 189
6.7.6.3.
Cofactors and quantifiers
. 190
6.7.7.
Notes on complexity
. 191
6.7.8.
Typed decision diagrams
. 192
6.7.8.1.
Positive functions
. 192
6.7.8.2.
TDG
. 192
6.7.8.3.
TDG implementation
. 193
6.7.8.4.
Interest in TDGs
. 193
6.7.9.
Care set and generalized cofactor
. 194
6.7.9.1.
"Knowing that" operators
. 194
6.7.9.2.
Generalized cofactor
. 194
6.7.9.3.
Restriction
. 194
6.7.9.4.
Algebraic properties of the generalized cofactor
. 195
6.8.
Forward symbolic exploration
. 195
6.8.1.
General scheme
. 196
10
Modeling and Verification of
Real-Time
Systems
6.8.2.
Detailed implementation
. 196
6.8.3.
Symbolic image computing
. 198
6.8.4.
Optimized image computing
. 198
6.8.4.1.
Principles
. 198
6.8.4.2.
Universal image
. 199
6.8.4.3.
Case of a single transition function
. 199
6.8.4.4.
Shannon's decomposition of the image
. 200
6.9.
Backward symbolic exploration
. 201
6.9.1.
General scheme
. 201
6.9.2.
Reverse image computing
. 202
6.9.3.
Comparing forward and backward methods
. 203
6.10.
Conclusion and related works
. 203
6.11.
Demonstrations
. 204
6.12.
Bibliography
. 205
Chapter
7.
Synchronous Functional Programming with Lucid
Synchrone
207
Paul
Caspi,
Grégoire
Hamon and Marc POUZET
7.1.
Introduction
. 207
7.1.1.
Programming reactive systems
. 207
7.1.1.1.
The synchronous languages
. 208
7.1.1.2.
Model-based design
. 210
7.1.1.3.
Converging needs
. 211
7.1.2.
Lucid
Synchrone. 211
7.2.
Lucid
Synchrone. 213
7.2.1.
An ML dataflow language
. 213
7.2.1.1.
Infinite streams as basic objects
. 213
7.2.1.2.
Temporal operations: delay and initialization
. 213
7.2.2.
Stream functions
. 214
7.2.3.
Multi-sampled systems
. 216
7.2.3.1.
The sampling operator when
. 217
7.2.3.2.
The combination operator merge
. 218
7.2.3.3.
Oversampling
. 219
7.2.3.4.
Clock constraints and synchrony
. 220
7.2.4.
Static values
. 222
7.2.5.
Higher-order features
. 222
7.2.6.
Datatypes and pattern matching
. 224
7.2.7.
A programming construct to share the memory
. 225
7.2.8.
Signals and signal patterns
. 227
7.2.8.1.
Signals as clock abstractions
. 227
7.2.8.2.
Testing presence and pattern matching over signals
. 228
7.2.9.
State machines and mixed designs
. 229
7.2.9.1.
Weak and strong preemption
. 229
7.2.9.2.
ABRO
and modular reset
. 230
Contents 11
7.2.9.3.
Local definitions to a state
. 231
7.2.9.4.
Communication between states and shared memory
. 232
7.2.9.5.
Resume or reset a state
. 233
7.2.10.
Parametrized state machines
. 233
7.2.11.
Combining state machines and signals
. 234
7.2.12.
Recursion and non-real-time features
. 236
7.2.13.
Two classical examples
. 236
7.2.13.1.
The inverted pendulum
. 236
7.2.13.2.
A heater
. 237
7.3.
Discussion
. 240
7.3.1.
Functional reactive programming and circuit description languages
240
7.3.2.
Lucid
Synchrone
as a prototyping language
. 241
7.4.
Conclusion
. 242
7.5.
Acknowledgment
. 243
7.6.
Bibliography
. 243
Chapter
8.
Verification of Real-Time Probabilistic Systems
. 249
Marta
Kwiatkowska, Gethin Norman, David Parker
and Jeremy Sproston
8.1.
Introduction
. 249
8.2.
Probabilistic timed automata
. 250
8.2.1.
Preliminaries
. 250
8.2.2.
Syntax of probabilistic timed automata
. 252
8.2.3.
Modeling with probabilistic timed automata
. 254
8.2.4.
Semantics of probabilistic timed automata
. 254
8.2.5.
Probabilistic reachability and
invariance
. 255
8.3.
Model checking for probabilistic timed automata
. 258
8.3.1.
The region graph
. 258
8.3.2.
Forward symbolic approach
. 261
8.3.2.1.
Symbolic state operations
. 261
8.3.2.2.
Computing maximum reachability probabilities
. 263
8.3.3.
Backward symbolic approach
. 266
8.3.3.1.
Symbolic state operations
. 266
8.3.3.2.
Probabilistic until
. 267
8.3.3.3.
Computing maximum reachability probabilities
. 268
8.3.3.4.
Computing minimum reachability probabilities
. 270
8.3.4.
Digital clocks
. 273
8.3.4.1.
Expected reachability
. 274
8.3.4.2.
Integral semantics
. 276
8.4.
Case study: the
ШЕЕ
FireWire
root contention protocol
. 277
8.4.1.
Overview
. 277
8.4.2.
Probabilistic timed automata model
. 278
8.4.3.
Model checking statistics
. 281
12
Modeling and Verification of Real-Time Systems
8.4.4.
Performance analysis
. 282
8.5.
Conclusion
. 285
8.6.
Bibliography
. 285
Chapter
9.
Verification of Probabilistic Systems Methods and Tools
. 289
Serge Haddad and Patrice Moreaux
9.1.
Introduction
. 289
9.2.
Performance evaluation of Markovian models
. 290
9.2.1.
A stochastic model of discrete event systems
. 290
9.2.2.
Discrete-time Markov chains
. 292
9.2.2.1.
Presentation
. 292
9.2.2.2.
Transient and steady-state behaviors of DTMC
. 293
9.2.3.
Continuous-time Markov chains
. 294
9.2.3.1.
Presentation
. 294
9.2.3.2.
Transient and steady-state behaviors of CTMC
. 295
9.3.
High level stochastic models
. 297
9.3.1.
Stochastic
Petri
nets with general distributions
. 297
9.3.1.1.
Choice policy
. 298
9.3.1.2.
Service policy
. 298
9.3.1.3.
Memory policy
. 298
9.3.2.
GLSPN with exponential distributions
. 299
9.3.3.
Performance indices of
SPN
. 300
9.3.4.
Overview of models and methods in performance evaluation
. . . 300
9.3.5.
The GreatSPN tool
. 301
9.3.5.1.
Supported models
. 302
9.3.5.2.
Qualitative analysis of
Petri
nets
. 302
9.3.5.3.
Performance analysis of stochastic
Petri
nets
. 302
9.3.5.4.
Software architecture
. 302
9.4.
Probabilistic verification of Markov chains
. 303
9.4.1.
Limits of standard performance indices
. 303
9.4.2.
A temporal logic for Markov chains
. 303
9.4.3.
Verification algorithms
. 305
9.4.4.
Overview of probabilistic verification of Markov chains
. 306
9.4.5.
The ETMCC tool
. 307
9.4.5.1.
Language of system models
. 307
9.4.5.2.
Language of properties
. 307
9.4.5.3.
Computed results
. 308
9.4.5.4.
Software architecture
. 308
9.5.
Markov decision processes
. 308
9.5.1.
Presentation of Markov decision processes
. 308
9.5.2.
A temporal logic for Markov decision processes
. 309
9.5.3.
Verification algorithms
. 309
9.5.4.
Overview of verification of Markov decision processes
. 313
Contents 13
9.5.5.
The PRISM tool
. 314
9.5.5.1.
Language of system models
. 314
9.5.5.2.
Properties language
. 314
9.5.5.3.
Computed results
. 314
9.5.5.4.
Software architecture
. 314
9.6.
Bibliography
. 315
Chapter
10.
Modeling and Verification of Real-Time Systems
using the IF Toolset
. 319
Marius Bozga,
Susanne Graf,
Laurent Mounier and
Iulian
Ober
10.1.
Introduction
. 320
10.2.
Architecture
. 322
10.3.
The IF notation
. 324
10.3.1.
Functional features
. 324
10.3.2.
Non-functional features
. 326
10.3.3.
Expressing properties with observers
. 328
10.4.
The IF tools
. 329
10.4.1.
Core components
. 329
10.4.2.
Static analysis
. 332
10.4.3.
Validation
. 333
10.4.4.
Translating UML to IF
. 334
10.4.4.1.
UML modeling
. 334
10.4.4.2.
The principles of the mapping from UML to IF
. 334
10.5.
An overview on uses of IF incase studies
. 336
10.6.
Case study: the
Ariane 5
flight program
. 337
10.6.1.
Overview of the
Ariane 5
flight program
. 337
10.6.2.
Verification of functional properties
. 339
10.6.3.
Verification of non-functional properties
. 343
10.6.4.
Modular verification and abstraction
. 344
10.7.
Conclusion
. 345
10.8.
Bibliography
. 347
Chapter
11.
Architecture Description Languages: An Introduction
totheSAEAADL
. 353
Anne-Marie DÉPLANCHE
and
Sébastien
FAUCOU
11.1.
Introduction
. 353
11.2.
Main characteristics of the architecture description languages
. 356
11.3.
ADLs and real-time systems
. 357
11.3.1.
Requirement analysis
. 357
11.3.2.
Architectural views
. 359
11.4.
Outline of related works
. 360
11.5.
The AADL language
.
362
11.5.1.
An overview of the AADL
. 363
14
Modeling and Verification of
Real-Time
Systems
11.6.
Case study
. 365
11.6.1.
Requirements
. 365
11.6.2.
Architecture design and analysis with AADL
. 366
11.6.2.1.
High-level design
. 366
11.6.2.2.
Thread and communication timing semantics
. 369
11.6.2.3.
Technical overview of the flow latency analysis algorithm
. 373
11.6.2.4.
Modeling fault-tolerance mechanisms
. 374
11.6.3.
Designing for reuse: package and refinement
. 377
11.7.
Conclusion
. 380
11.8.
Bibliography
. 381
List of Authors
. 385
Index
. 389 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author2 | Merz, Stephan |
| author2_role | edt |
| author2_variant | s m sm |
| author_facet | Merz, Stephan |
| building | Verbundindex |
| bvnumber | BV022958624 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.54 |
| callnumber-search | QA76.54 |
| callnumber-sort | QA 276.54 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 170 ST 234 |
| ctrlnum | (OCoLC)180190932 (DE-599)BSZ263451909 |
| dewey-full | 004.01/51 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.01/51 |
| dewey-search | 004.01/51 |
| dewey-sort | 14.01 251 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01605nam a22004332c 4500</leader><controlfield tag="001">BV022958624</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090219 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071112s2008 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848210134</subfield><subfield code="9">978-1-84821-013-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)180190932</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ263451909</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-824</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.54</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.01/51</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 170</subfield><subfield code="0">(DE-625)143602:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 234</subfield><subfield code="0">(DE-625)143621:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modeling and verification of real-time systems</subfield><subfield code="b">formalisms and software tools</subfield><subfield code="c">ed. by Stephan Merz ...</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">ISTE [u.a.]</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">393 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield><subfield code="x">Verification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal methods (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeitsystem</subfield><subfield code="0">(DE-588)4131397-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeitverarbeitung</subfield><subfield code="0">(DE-588)4151002-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Echtzeitverarbeitung</subfield><subfield code="0">(DE-588)4151002-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Echtzeitsystem</subfield><subfield code="0">(DE-588)4131397-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Merz, Stephan</subfield><subfield code="4">edt</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016163019&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016163019</subfield></datafield></record></collection> |
| id | DE-604.BV022958624 |
| illustrated | Illustrated |
| index_date | 2024-07-02T19:03:47Z |
| indexdate | 2024-07-09T21:08:34Z |
| institution | BVB |
| isbn | 9781848210134 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016163019 |
| oclc_num | 180190932 |
| open_access_boolean | |
| owner | DE-824 DE-703 DE-11 |
| owner_facet | DE-824 DE-703 DE-11 |
| physical | 393 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | ISTE [u.a.] |
| record_format | marc |
| spelling | Modeling and verification of real-time systems formalisms and software tools ed. by Stephan Merz ... 1. publ. London ISTE [u.a.] 2008 393 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer software Verification Formal methods (Computer science) Real-time data processing Echtzeitsystem (DE-588)4131397-5 gnd rswk-swf Echtzeitverarbeitung (DE-588)4151002-1 gnd rswk-swf Echtzeitverarbeitung (DE-588)4151002-1 s DE-604 Echtzeitsystem (DE-588)4131397-5 s Merz, Stephan edt Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016163019&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Modeling and verification of real-time systems formalisms and software tools Computer software Verification Formal methods (Computer science) Real-time data processing Echtzeitsystem (DE-588)4131397-5 gnd Echtzeitverarbeitung (DE-588)4151002-1 gnd |
| subject_GND | (DE-588)4131397-5 (DE-588)4151002-1 |
| title | Modeling and verification of real-time systems formalisms and software tools |
| title_auth | Modeling and verification of real-time systems formalisms and software tools |
| title_exact_search | Modeling and verification of real-time systems formalisms and software tools |
| title_exact_search_txtP | Modeling and verification of real-time systems formalisms and software tools |
| title_full | Modeling and verification of real-time systems formalisms and software tools ed. by Stephan Merz ... |
| title_fullStr | Modeling and verification of real-time systems formalisms and software tools ed. by Stephan Merz ... |
| title_full_unstemmed | Modeling and verification of real-time systems formalisms and software tools ed. by Stephan Merz ... |
| title_short | Modeling and verification of real-time systems |
| title_sort | modeling and verification of real time systems formalisms and software tools |
| title_sub | formalisms and software tools |
| topic | Computer software Verification Formal methods (Computer science) Real-time data processing Echtzeitsystem (DE-588)4131397-5 gnd Echtzeitverarbeitung (DE-588)4151002-1 gnd |
| topic_facet | Computer software Verification Formal methods (Computer science) Real-time data processing Echtzeitsystem Echtzeitverarbeitung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016163019&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT merzstephan modelingandverificationofrealtimesystemsformalismsandsoftwaretools |