Models, Algorithms, Logics and Tools Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Aceto, Luca (Επιμελητής έκδοσης), Bacci, Giorgio (Επιμελητής έκδοσης), Bacci, Giovanni (Επιμελητής έκδοσης), Ingólfsdóttir, Anna (Επιμελητής έκδοσης), Legay, Axel (Επιμελητής έκδοσης), Mardare, Radu (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2017.
• Σειρά: Lecture Notes in Computer Science, 10460
• Θέματα: Computer science.; Computer organization.; Software engineering.; Programming languages (Electronic computers).; Computers.; Artificial intelligence.; Computer simulation.; Computer Science.; Theory of Computation.; Software Engineering.; Simulation and Modeling.; Programming Languages, Compilers, Interpreters.; Artificial Intelligence (incl. Robotics).; Computer Systems Organization and Communication Networks.

 This 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. 

 Information 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.