000 06436nam a22006015i 4500
001 978-3-031-22337-2
003 DE-He213
005 20240423130126.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 _a9783031223372
_9978-3-031-22337-2
024 7 _a10.1007/978-3-031-22337-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aPrinciples of Systems Design
_h[electronic resource] :
_bEssays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday /
_cedited by Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2022.
300 _aXV, 666 p. 162 illus., 84 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13660
505 0 _aHybrid, 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.
520 _aThis Festschrift is dedicated to Thomas A. Henzinger on the occasion of his 60th birthday in 2022. After studies at Kepler University in Linz and the University of Delaware, Tom’s Ph.D. work in Stanford led to the foundations of models and analysis techniques for real-time systems. The thesis is representative of his entire research career: elegant, deep theoretical results with clear application potential. Tom spent time at the IMAG Laboratory in Grenoble, Cornell, UC Berkeley, EPFL, and the Max Planck Institute for Informatics in Saarbrücken. In 2009 he became the founding President of the Institute of Science and Technology Austria, which under his leadership has become a world-class interdisciplinary research institute. Tom Henzinger is one of the leading researchers in computer-aided verification. He developed influential models and tools for the design of reactive, timed, and hybrid systems. This laid the theoretical foundation forverifying multi-agent, real-time, and embedded software, extending automata, logics, and verification algorithms from finite-state reactive systems to cyber-physical systems. He has made deep contributions in areas such as software model checking; quantitative notions of correctness and robustness measures for software; graph games for the algorithmic synthesis of control systems; formal methods for increasing trust in machine-learned systems; and executable symbolic models for biological systems. In all his roles, Tom has promoted excellent science, characterized by intellectual rigor, vision, stimulating collaborations, and elegant communication. 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. ---.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSoftware Engineering.
700 1 _aRaskin, Jean-François.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aChatterjee, Krishnendu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDoyen, Laurent.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMajumdar, Rupak.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031223365
776 0 8 _iPrinted edition:
_z9783031223389
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13660
856 4 0 _uhttps://doi.org/10.1007/978-3-031-22337-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c185318
_d185318