LEADER 06114nam 22008415 450 001 9910484651003321 005 20230223100225.0 010 $a3-319-63121-7 024 7 $a10.1007/978-3-319-63121-9 035 $a(CKB)4340000000061635 035 $a(DE-He213)978-3-319-63121-9 035 $a(MiAaPQ)EBC6285569 035 $a(MiAaPQ)EBC5578857 035 $a(Au-PeEL)EBL5578857 035 $a(OCoLC)1066176985 035 $a(PPN)203849825 035 $a(EXLCZ)994340000000061635 100 $a20170724d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aModels, Algorithms, Logics and Tools $eEssays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday /$fedited by Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, Radu Mardare 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XVII, 662 p. 184 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10460 300 $aIncludes index. 311 $a3-319-63120-9 327 $aInformation Flow for Timed Automata -- A Nivat Theorem for Quantitative Automata on Unranked Trees -- 30 Years of Modal Transition Systems: Survey of Extensions and Analysis -- Derivatives of Quantitative Regular Expressions -- Improving the Timed Automata Approach to Biological Pathway Dynamics -- Bicategories of Markov Processes -- Property-Preserving Parallel Decomposition -- A Generic Algorithm for Learning Symbolic Automata from Membership Queries -- Teaching Academic Concurrency to Amazing Students -- Negative Results on Decidability and Small Model Property of Process Equations -- Timed Temporal Logics -- Synchronous Interfaces and Assume/Guarantee Contracts -- From Transition Systems to Variability Models & From Lifted Model Checking Back to UPPAAL -- Firm Deadline Checking of Safety-Critical Java Applications with Statistical Model Checking -- Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata -- Runtime Verification Logics - A Language Design Perspective -- Testing Divergent Transition Systems -- The Cost of Exactness in Quantitative Reachability -- Towards Automated Variant Selection for HeterogeneousTiled Architectures -- Admissible Strategies in Timed Games -- Modal Stochastic Games: Abstraction-Refinement of Probabilistic Automata -- A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes -- Syntactic Markovian Bisimulation for Chemical Reaction Networks -- Assertion-Based Reasoning Method for Calculus of Wireless System -- Taming Living Logic Using Formal Methods -- Comparing Source Sets and Persistent Sets for Partial Order Reduction -- A Framework for Evaluating Schedulability Analysis Tools -- WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL -- Centrally Governed Blockchains: Optimizing Security, Cost, and Availability -- Energy Consumption Forecast of Photo-Voltaic Comfort Cooling Using UPPAAL Stratego -- Towards a Tool: TIMES-Pro for Modeling, Analysis, Simulation and Implementation of Cyber-Physical Systems -- Formalising a Hazard Warning Communication Protocol with Timed Automata. 330 $aThis Festschrift is published in honor of Kim Guldstrand Larsen, one of the earliest precursors of computer science in Denmark, on the occasion of his 60th birthday. During the last three decades, Kim Guldstrand Larsen has given major contributions across a remarkably wide range of topics, including real-time, concurrent, and probabilistic models of computation, logic in computer science, and model checking. Since 1995, he has been one of the prime movers behind the model checking tool for real-time systems UPPAAL, for which he was a co-recipient of the CAV Award in 2013. The Festschrift contains 32 papers that feature the broad range of Kim Guldstrand Larsen's research topics, such as formal languages and automata theory; logic; verification, model checking and testing; algorithmic game theory and mechanism design; semantics and reasoning; real-time and distributed systems; and modeling and simulation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10460 606 $aComputer science 606 $aSoftware engineering 606 $aComputer simulation 606 $aCompilers (Computer programs) 606 $aArtificial intelligence 606 $aComputer engineering 606 $aComputer networks 606 $aTheory of Computation 606 $aSoftware Engineering 606 $aComputer Modelling 606 $aCompilers and Interpreters 606 $aArtificial Intelligence 606 $aComputer Engineering and Networks 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aComputer simulation. 615 0$aCompilers (Computer programs). 615 0$aArtificial intelligence. 615 0$aComputer engineering. 615 0$aComputer networks. 615 14$aTheory of Computation. 615 24$aSoftware Engineering. 615 24$aComputer Modelling. 615 24$aCompilers and Interpreters. 615 24$aArtificial Intelligence. 615 24$aComputer Engineering and Networks. 676 $a003.54 702 $aAceto$b Luca$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBacci$b Giorgio$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBacci$b Giovanni$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aIngólfsdóttir$b Anna$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLegay$b Axel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMardare$b Radu$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484651003321 996 $aModels, Algorithms, Logics and Tools$92831682 997 $aUNINA