Automatic Verification Methods for Finite State Systems: International Workshop, Grenoble, France. June 12-14, 1989. Proceedings: Lecture Notes in Computer Science, cartea 407
Editat de Joseph Sifakisen Limba Engleză Paperback – 10 ian 1990
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 324.68 lei
Preț vechi: 405.84 lei
-20% Nou
Puncte Express: 487
Preț estimativ în valută:
57.45€ • 67.46$ • 50.43£
57.45€ • 67.46$ • 50.43£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540521488
ISBN-10: 3540521488
Pagini: 396
Ilustrații: XI, 384 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.56 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540521488
Pagini: 396
Ilustrații: XI, 384 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.56 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Process calculi, from theory to practice: Verification tools.- Testing equivalence as a bisimulation equivalence.- The concurrency workbench.- Argonaute: Graphical description, semantics and verification of reactive systems by using a process algebra.- Using the axiomatic presentation of behavioural equivalences for manipulating CCS specifications.- Verifying properties of large sets of processes with network invariants.- A method for verification of trace and test equivalence.- Projections of the reachability graph and environment models.- Proving properties of elementary net systems with a special-purpose theorem prover.- Verification by abstraction and bisimulation.- MEC : a system for constructing and analysing transition systems.- Fair SMG and linear time model checking.- Network grammars, communication behaviors and automatic verification.- CCS, liveness, and local model checking in the linear time mu-calculus.- Implementing a model checking algorithm by adapting existing automated tools.- On-line model-checking for finite linear temporal logic specifications.- Timing assumptions and verification of finite-state concurrent systems.- Specifying, programming and verifying real-time systems using a synchronous declarative language.- Modal specifications.- Automated verification of timed transition models.- Temporal logic case study.- The complexity of collapsing reachability graphs.- What are the limits of model checking methods for the verification of real life protocols?.- Requirement analysis for communication protocols.- State exploration by transformation with lola.- Parallel protocol verification: The two-phase algorithm and complexity analysis.- Formal verification of synchronous circuits based on string-functional semantics: The 7 paillet circuits in boyer-moore.- Combining CTL, trace theory and timing models.- Localized verification of circuit descriptions.- Verification of synchronous sequential machines based on symbolic execution.- Parallel composition of lockstep synchronous processes for hardware validation: Divide-and-conquer composition.