000 04809nam a22005295i 4500
001 978-3-031-56222-8
003 DE-He213
005 20240423130334.0
007 cr nn 008mamaa
008 240319s2024 sz | s |||| 0|eng d
020 _a9783031562228
_9978-3-031-56222-8
024 7 _a10.1007/978-3-031-56222-8
_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 _aTaming the Infinities of Concurrency
_h[electronic resource] :
_bEssays Dedicated to Javier Esparza on the Occasion of His 60th Birthday /
_cedited by Stefan Kiefer, Jan Křetínský, Antonín Kučera.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXII, 309 p. 92 illus., 25 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 ;
_v14660
505 0 _aFairness and Liveness under Weak Consistency -- Restricted Flow Games -- SynthLearn: a Tool for Guided Reactive Synthesis -- On Regular Expression Proof Complexity of Salomaa’s Axiom System F1 -- Hidden Markov Models with Unobservable Transitions -- Coverability in Well-Formed Free-Choice Petri Nets -- Devillers On verifying concurrent programs under weak consistency models: Decidability and Complexity -- A Summary and Personal Perspective on Recent Advances in Privacy Risk Assessment in Digital Pathology through Formal Methods -- A Uniform Framework for Language Inclusion Problems -- On the Home-Space Problem for Petri Nets -- Leroux Newton’s Method – There and Back Again -- Template-Based Verification of Array-Manipulating Programs -- Memoryless Strategies in Stochastic Reachability Games -- Region Quadtrees Verified -- Computing pre* for General Context Free Languages -- 2-Pointer Logic.
520 _aJavier Esparza received his primary degree in Theoretical Physics and in 1990 his PhD in Computer Science from the University of Zaragoza. After positions at the University of Hildesheim, the University of Edinburgh, and the Technical University of Munich, he then held professorships at the University of Edinburgh and the University of Stuttgart, and finally returned to TU Munich where he currently holds the Chair of Foundations of Software Reliability and Theoretical Computer Science. Javier is a leading researcher in concurrency theory, distributed and probabilistic systems, Petri nets, analysis of infinite-state models, and more generally formal methods for the verification of computer systems. He has coauthored over 200 publications, many of them highly influential. He coauthored the monographs Free Choice Petri Nets, and Unfoldings: A Partial Order Approach to Model Checking, and more recently the textbook Automata Theory: An Algorithmic Approach. The latter is an exampleof Javier’s many activities as a teacher, he has supervised more than 20 PhD students, taught at more than 20 summer schools, and won many awards for his university teaching. He is regularly invited to deliver plenary talks at prestigious computer science conferences and participate in senior program committees, he has contributed as a senior member of technical working groups, society councils, and journal editorial boards, and in 2021 he became a founding Editor-in-Chief of the open-access TheoretiCS journal. This Festschrift celebrates Javier’s contributions on the occasion of his 60th birthday, the contributions reflect the breadth and depth of his successes in Petri nets, concurrency in general, distributed and probabilistic systems, games, formal languages, logic, program analysis, verification, and synthesis. .
650 0 _aComputer science.
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aKiefer, Stefan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKřetínský, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKučera, Antonín.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031562211
776 0 8 _iPrinted edition:
_z9783031562235
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14660
856 4 0 _uhttps://doi.org/10.1007/978-3-031-56222-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c187512
_d187512