Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/models-algorithms-logics-and-tools/descriptif_3961107
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3961107

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Models, Algorithms, Logics and Tools, 1st ed. 2017 Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday Theoretical Computer Science and General Issues Series

Langue : Anglais

Coordonnateurs : Aceto Luca, Bacci Giorgio, Bacci Giovanni, Ingólfsdóttir Anna, Legay Axel, Mardare Radu

Couverture de l’ouvrage Models, Algorithms, Logics and Tools

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.

Contains papers dedicated to Kim Guldstrand Larsen

Features the broad range of Kim Guldstrand Larsen's research topics, including real-time, concurrent, and probabilistic models of computation, logic in computer science, and model checking

Addresses a large diversity of topics

Includes supplementary material: sn.pub/extras