Del 13660 - Lecture Notes in Computer Science

Principles of Systems Design

Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday

Häftad, Engelska, 2022

AvJean-François Raskin,Krishnendu Chatterjee,Laurent Doyen,Rupak Majumdar,Jean-Francois Raskin

1 269 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Henzinger on the occasion of his 60th birthday in 2022. This Festschrift volume celebrates his many contributions in the field of computer science, with 31 papers covering various research and application directions, authored by scientists inspired by his efforts and example over many years.

Produktinformation

Utgivningsdatum2022-12-29
Mått155 x 235 x 37 mm
Vikt1 019 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor666
FörlagSpringer International Publishing AG
ISBN9783031223365

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Programvaruutveckling inom Data och IT
Artificiell intelligens inom Data och IT

Hybrid, timed, cyber-physical and dynamical systems.- From Hybrid Automata to DAE-based modeling.- What's Decidable about Discrete Linear Dynamical Systems?.- Symbolic Analysis of Linear Hybrid Automata { 25 Years Later.- A Fault-Tolerant Architecture for Safe Driving Automation.- Specification and Validation of Autonomous Driving Systems: A Multilevel Semantic Framework.- On Specifications and Proofs of Timed Circuits.- Asynchronous Correspondences Between Hybrid Trajectory Semantics.- Generalizing Logical Execution Time.- Automata, logic and games.- Towards a Grand Uni cation of Buechi Complementation Constructions.- A Simple Rewrite System for the Normalization of Linear Temporal Logic.- Survey on Satisfiability Checking for the mu-Calculus through Tree Automata.- Universal algorithms for parity games and nested xpoints.- Simulation relations and applications in formal methods.- Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification.-Getting Saturated with Induction.- Voronkov Probabilistic and quantitative verification.- On Probabilistic Monitorability.- On the Foundations of Cycles in Bayesian Networks.- Satisfiability of quantitative probabilistic CTL: Rise to the challenge.- Symbolic Verification and Strategy Synthesis for Turn-based Stochastic Games.- Parameter Synthesis in Markov Models: A Gentle Survey.- Convex Lattice Equation Systems.- Variance Reduction for Estimating Event Probabilities of Chemical Reaction Networks.- Software systems theory.- From Interface Automata to Hypercontracts.- Consistency and Persistency in Program Verification: Challenges and Opportunities.- Automated Program Repair Using Formal Verification Techniques.- Embedded Domain Specific Verifiers.- Software Model Checking: 20 Years and Beyond.- Artificial intelligence and machine learning.- T4V: Exploring Neural Network Architectures that Improve the Scalability of Neural Network Verification.- A framework for transforming specifications in reinforcement learning.- Robustness Analysis of Continuous-Depth Models with Lagrangian Techniques.- Correct-by-Construction Runtime Enforcement in AI - A Survey.