LEADER 05630nam 2200709Ia 450 001 9910139523503321 005 20170809153000.0 010 $a1-282-16492-9 010 $a9786612164927 010 $a0-470-61101-4 010 $a0-470-39359-9 035 $a(CKB)2550000000005855 035 $a(EBL)477643 035 $a(OCoLC)520990427 035 $a(SSID)ssj0000340482 035 $a(PQKBManifestationID)11266909 035 $a(PQKBTitleCode)TC0000340482 035 $a(PQKBWorkID)10408059 035 $a(PQKB)11610461 035 $a(MiAaPQ)EBC477643 035 $a(PPN)237199173 035 $a(EXLCZ)992550000000005855 100 $a20071030d2008 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aModeling and verification of real-time systems$b[electronic resource] $eformalisms and software tools /$fedited by Stephan Merz, Nicolas Navet 210 $aLondon $cISTE ;$aHoboken, NJ $cJohn Wiley$d2008 215 $a1 online resource (395 p.) 225 1 $aISTE ;$vv.16 300 $aDescription based upon print version of record. 311 $a1-84821-013-2 320 $aIncludes bibliographical references and index. 327 $aModeling and Verification of Real-Time Systems: Formalisms and Software Tools; Contents; Preface; Chapter 1. Time Petri Nets - Analysis Methods and Verification with TINA; 1.1. Introduction; 1.2. Time Petri nets; 1.2.1. Definition; 1.2.2. States and the state reachability relation; 1.2.3. Illustration; 1.2.4. Some general theorems; 1.3. State class graphs preserving markings and LTL properties; 1.3.1. State classes; 1.3.2. Illustration; 1.3.3. Checking the boundedness property on-the-fly; 1.3.4. Variations; 1.3.4.1. Multiple enabledness; 1.3.4.2. Preservation of markings (only) 327 $a1.4. State class graphs preserving states and LTL properties1.4.1. Clock domain; 1.4.2. Construction of the SSCG; 1.4.3. Variants; 1.5. State class graphs preserving states and branching properties; 1.6. Computing firing schedules; 1.6.1. Schedule systems; 1.6.2. Delays (relative dates) versus dates (absolute); 1.6.3. Illustration; 1.7. An implementation: the Tina environment; 1.8. The verification of SE-LTL formulae in Tina; 1.8.1. The temporal logic SE-LTL; 1.8.2. Preservation of LTL properties by tina constructions; 1.8.3. selt: the SE-LTL checker of Tina; 1.8.3.1. Verification technique 327 $a1.8.3.2. The selt logic1.9. Some examples of use of selt; 1.9.1. John and Fred; 1.9.1.1. Statement of problem; 1.9.1.2. Are the temporal constraints appearing in this scenario consistent?; 1.9.1.3. Is it possible that Fred took the bus and John the carpool?; 1.9.1.4. At which time could Fred have left home?; 1.9.2. The alternating bit protocol; 1.10. Conclusion; 1.11. Bibliography; Chapter 2. Validation of Reactive Systems by Means of Verification and Conformance Testing; 2.1. Introduction; 2.2. The IOSTS model; 2.2.1. Syntax of IOSTS; 2.2.2. Semantics of IOSTS; 2.3. Basic operations on IOSTS 327 $a2.3.1. Parallel product2.3.2. Suspension; 2.3.3. Deterministic IOSTS and determinization; 2.4. Verification and conformance testing with IOSTS; 2.4.1. Verification; 2.4.1.1. Verifying safety properties; 2.4.1.2. Verifying possibility properties; 2.4.1.3. Combining observers; 2.4.2. Conformance testing; 2.5. Test generation; 2.6. Test selection; 2.7. Conclusion and related work; 2.8. Bibliography; Chapter 3. An Introduction to Model Checking; 3.1. Introduction; 3.2. Example: control of an elevator; 3.3. Transition systems and invariant checking; 3.3.1. Transition systems and their runs 327 $a3.3.2. Verification of invariants3.4. Temporal logic; 3.4.1. Linear-time temporal logic; 3.4.2. Branching-time temporal logic; 3.4.3. ?-automata; 3.4.4. Automata and PTL; 3.5. Model checking algorithms; 3.5.1. Local PTL model checking; 3.5.2. Global CTL model checking; 3.5.3. Symbolic model checking algorithms; 3.6. Some research topics; 3.7. Bibliography; Chapter 4. Model Checking Timed Automata; 4.1. Introduction; 4.2. Timed automata; 4.2.1. Some notations; 4.2.2. Timed automata, syntax and semantics; 4.2.3. Parallel composition; 4.3. Decision procedure for checking reachability 327 $a4.4. Other verification problems 330 $aThis title is devoted to presenting some of the most important concepts and techniques for describing real-time systems and analyzing their behavior in order to enable the designer to achieve guarantees of temporal correctness. Topics addressed include mathematical models of real-time systems and associated formal verification techniques such as model checking, probabilistic modeling and verification, programming and description languages, and validation approaches based on testing. With contributions from authors who are experts in their respective fields, this will provide the reader with 410 0$aISTE 606 $aReal-time data processing 606 $aComputer software$xVerification 606 $aFormal methods (Computer science) 615 0$aReal-time data processing. 615 0$aComputer software$xVerification. 615 0$aFormal methods (Computer science) 676 $a004.01/51 676 $a004.0151 686 $aST 170$2rvk 686 $aST 234$2rvk 701 $aNavet$b Nicolas$0916519 701 $aMerz$b Stephan$0503992 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910139523503321 996 $aModeling and verification of real-time systems$92054516 997 $aUNINA LEADER 01085nam a2200313 i 4500 001 991001170799707536 005 20020507184544.0 008 931123s1986 us ||| | eng 020 $a0821815237 035 $ab1081064x-39ule_inst 035 $aLE01308160$9ExL 040 $aDip.to Matematica$beng 082 0 $a515.2433 084 $aAMS 22-XX 084 $aAMS 35-XX 084 $aAMS 43-XX 084 $aQA403.T29 100 1 $aTaylor, Michael Eugene$0536219 245 10$aNoncommutative harmonic analysis /$cMichael E. Taylor 260 $aProvidence, R. I. :$bAmerican Mathematical Society,$c1986 300 $axvi, 328 p. ;$c26 cm. 490 0 $aMathematical surveys and monographs,$x0076-5376 ;$v22 650 0$aHarmonic analysis 907 $a.b1081064x$b23-02-17$c28-06-02 912 $a991001170799707536 945 $aLE013 43-XX TAY11 (1986)$g1$i2013000004419$lle013$o-$pE0.00$q-$rl$s- $t0$u1$v0$w1$x0$y.i10915965$z28-06-02 996 $aNoncommutative harmonic analysis$9924945 997 $aUNISALENTO 998 $ale013$b01-01-93$cm$da $e-$feng$gus $h0$i1 LEADER 05796nam 22006375 450 001 9910779321403321 005 20230905220111.0 010 $a1-4008-4611-0 010 $a1-299-13927-2 024 7 $a10.1515/9781400846115 035 $a(CKB)2550000001000524 035 $a(EBL)1105925 035 $a(OCoLC)832618068 035 $a(SSID)ssj0000906747 035 $a(PQKBManifestationID)11553696 035 $a(PQKBTitleCode)TC0000906747 035 $a(PQKBWorkID)10854719 035 $a(PQKB)10289647 035 $a(DE-B1597)447195 035 $a(OCoLC)834555589 035 $a(OCoLC)979905334 035 $a(DE-B1597)9781400846115 035 $a(MiAaPQ)EBC1105925 035 $a(EXLCZ)992550000001000524 100 $a20190708d2013 fg 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aDigital Dice $eComputational Solutions to Practical Probability Problems /$fPaul J. Nahin 205 $aWith a New preface by the author 210 1$aPrinceton, NJ :$cPrinceton University Press,$d[2013] 210 4$dİ2013 215 $a1 online resource (289 p.) 225 0 $aPrinceton Puzzlers 300 $aDescription based upon print version of record. 311 $a0-691-15821-5 320 $aIncludes bibliographical references and index. 327 $tFrontmatter --$tContents --$tPreface to the Paperback Edition --$tIntroduction --$tThe Problems --$t1. The Clumsy Dishwasher Problem --$t2. Will Lil and Bill Meet at the Malt Shop? --$t3. A Parallel Parking Question --$t4. A Curious Coin-Flipping Game --$t5. The Gamow-Stern Elevator Puzzle --$t6. Steve's Elevator Problem --$t7. The Pipe Smoker's Discovery --$t8. A Toilet Paper Dilemma --$t9. The Forgetful Burglar Problem --$t10. The Umbrella Quandary --$t11. The Case of the Missing Senators --$t12. How Many Runners in a Marathon? --$t13. A Police Patrol Problem --$t14. Parrondo's Paradox --$t15. How Long Is the Wait to Get the Potato Salad? --$t16. The Appeals Court Paradox --$t17. Waiting for Buses --$t18. Waiting for Stoplights --$t19. Electing Emperors and Popes --$t20. An Optimal Stopping Problem --$t21. Chain Reactions, Branching Processes, and Baby Boys --$tThe Solutions --$t1. The Clumsy Dishwasher Problem --$t2. Will Lil and Bill Meet at the Malt Shop? --$t3. A Parallel Parking Question --$t4. A Curious Coin-Flipping Game --$t5. The Gamow-Stern Elevator Puzzle --$t6. Steve's Elevator Problem --$t7. The Pipe Smoker's Discovery --$t8. A Toilet Paper Dilemma --$t9. The Forgetful Burglar Problem --$t10. The Umbrella Quandary --$t11. The Case of the Missing Senators --$t12. How Many Runners in a Marathon? --$t13. A Police Patrol Problem --$t14. Parrondo's Paradox --$t15. How Long Is the Wait to Get the Potato Salad? --$t16. The Appeals Court Paradox --$t17. Waiting for Buses --$t18. Waiting for Stoplights --$t19. Electing Emperors and Popes --$t20. An Optimal Stopping Problem --$t21. Chain Reactions, Branching Processes, and Baby Boys --$tAppendix 1. One Way to Guess on a Test --$tAppendix 2. An Example of Variance Reduction in the Monte Carlo Method --$tAppendix 3. Random Harmonic Series --$tAppendix 4. Solving Montmort's Problem by Recursion --$tAppendix 5. An Illustration of the Inclusion-Exclusion Principle --$tAppendix 6. Solutions to the Spin Game --$tAppendix 7. How to Simulate Kelvin's Fair Coin with a Biased Coin --$tAppendix 8. How to Simulate an Exponential Random Variable --$tAppendix 9. Author-Created MATLAB m-files and Their Location in the Book --$tGlossary --$tAcknowledgments --$tIndex --$tAlso by Paul J. Nahin 330 $aSome probability problems are so difficult that they stump the smartest mathematicians. But even the hardest of these problems can often be solved with a computer and a Monte Carlo simulation, in which a random-number generator simulates a physical process, such as a million rolls of a pair of dice. This is what Digital Dice is all about: how to get numerical answers to difficult probability problems without having to solve complicated mathematical equations. Popular-math writer Paul Nahin challenges readers to solve twenty-one difficult but fun problems, from determining the odds of coin-flipping games to figuring out the behavior of elevators. Problems build from relatively easy (deciding whether a dishwasher who breaks most of the dishes at a restaurant during a given week is clumsy or just the victim of randomness) to the very difficult (tackling branching processes of the kind that had to be solved by Manhattan Project mathematician Stanislaw Ulam). In his characteristic style, Nahin brings the problems to life with interesting and odd historical anecdotes. Readers learn, for example, not just how to determine the optimal stopping point in any selection process but that astronomer Johannes Kepler selected his second wife by interviewing eleven women. The book shows readers how to write elementary computer codes using any common programming language, and provides solutions and line-by-line walk-throughs of a MATLAB code for each problem. Digital Dice will appeal to anyone who enjoys popular math or computer science. In a new preface, Nahin wittily addresses some of the responses he received to the first edition. 410 0$aPrinceton Puzzlers 606 $aMathematics$2HILCC 606 $aPhysical Sciences & Mathematics$2HILCC 606 $aMathematical Statistics$2HILCC 615 7$aMathematics 615 7$aPhysical Sciences & Mathematics 615 7$aMathematical Statistics 676 $a519.2076 700 $aNahin$b Paul J.$048655 801 0$bDE-B1597 801 1$bDE-B1597 906 $aBOOK 912 $a9910779321403321 996 $aDigital Dice$93797792 997 $aUNINA