Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    almafu_BV048495928
    Umfang: 1 Online-Ressource : , Illustrationen, Diagramme.
    ISBN: 978-3-031-15629-8
    Serie: Lecture notes in computer science 13560
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-15628-1
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-15630-4
    Sprache: Englisch
    Schlagwort(e): Festschrift ; Festschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Volltext  (URL des Erstveröffentlichers)
    Mehr zum Autor: Jansen, Nils 1982-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    gbv_1816516317
    Umfang: 1 Online-Ressource(XIII, 581 p. 133 illus., 66 illus. in color.)
    Ausgabe: 1st ed. 2022.
    ISBN: 9783031156298
    Serie: Lecture Notes in Computer Science 13560
    Inhalt: Non-Finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction -- Operational Causality -- Necessarily Sufficient and Sufficiently Necessary -- Axiomatizing consciousness, with applications -- Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory -- A Survey of Model Learning Techniques for Recurrent Neural Networks -- Back-and-Forth in Space: On Logics and Bisimilarity in Closure Spaces -- Better Automata through Process Algebra -- Family-Based Fingerprint Analysis: A Position Paper -- What's in School? - Topic Maps for Secondary School Computer Science -- Tree-Based Adaptive Model Learning -- From Languages to Behaviors and Back -- The Quest for an Adequate Semantic Basis of Dense-Time Metric Temporal Logic -- Equivalence Checking 40 Years After: A Review of Bisimulation Tools -- Apartness and Distinguishing formulas in Using the parallel ATerm library for parallel model checking and state space generation -- Active Automata Learning as Black-Box Search and Lazy Partition Refinement -- A Reconstruction of Ewens' Sampling Formula via Lists of Coins -- Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof -- Learning Language Intersections -- Runtime verification of compound components with ComMA -- A Basic Compositional Model for Spiking Neural Networks -- State Identification and Verification with Satisfaction -- A Note on the Message Complexity of Cidon’s Distributed Depth-First Search Algorithm -- Minesweeper is difficult indeed!- Goodbye ioco -- Process Algebras and Flocks of Birds -- The Integration of Testing and Program Verification -- Discovering Directly-Follows Complete Petri Nets From Event Data -- Fair Must Testing for I/O Automata -- Passive automata learning: DFAs and NFAs.
    Inhalt: This Festschrift, dedicated to Frits W. Vaandrager on the occasion of his 60th birthday, contains papers written by many of his closest collaborators. Frits has been a Professor of Informatics for Technical Applications at Radboud University Nijmegen since 1995, where his research focuses on formal methods, concurrency theory, verification, model checking, and automata learning. The volume contains contributions of colleagues, Ph.D. students, and researchers with whom Frits has collaborated and inspired, reflecting a wide spectrum of scientific interests, and demonstrating successful work at the highest levels of both theory and practice.
    Weitere Ausg.: ISBN 9783031156281
    Weitere Ausg.: ISBN 9783031156304
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783031156281
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783031156304
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Festschrift ; Festschrift
    URL: Cover
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Volltext  (URL des Erstveröffentlichers)
    Mehr zum Autor: Jansen, Nils 1982-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    almahu_9949372074102882
    Umfang: XIII, 581 p. 133 illus., 66 illus. in color. , online resource.
    Ausgabe: 1st ed. 2022.
    ISBN: 9783031156298
    Serie: Lecture Notes in Computer Science, 13560
    Inhalt: This Festschrift, dedicated to Frits W. Vaandrager on the occasion of his 60th birthday, contains papers written by many of his closest collaborators. Frits has been a Professor of Informatics for Technical Applications at Radboud University Nijmegen since 1995, where his research focuses on formal methods, concurrency theory, verification, model checking, and automata learning. The volume contains contributions of colleagues, Ph.D. students, and researchers with whom Frits has collaborated and inspired, reflecting a wide spectrum of scientific interests, and demonstrating successful work at the highest levels of both theory and practice.
    Anmerkung: Non-Finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction -- Operational Causality -- Necessarily Sufficient and Sufficiently Necessary -- Axiomatizing consciousness, with applications -- Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory -- A Survey of Model Learning Techniques for Recurrent Neural Networks -- Back-and-Forth in Space: On Logics and Bisimilarity in Closure Spaces -- Better Automata through Process Algebra -- Family-Based Fingerprint Analysis: A Position Paper -- What's in School? - Topic Maps for Secondary School Computer Science -- Tree-Based Adaptive Model Learning -- From Languages to Behaviors and Back -- The Quest for an Adequate Semantic Basis of Dense-Time Metric Temporal Logic -- Equivalence Checking 40 Years After: A Review of Bisimulation Tools -- Apartness and Distinguishing formulas in Using the parallel ATerm library for parallel model checking and state space generation -- Active Automata Learning as Black-Box Search and Lazy Partition Refinement -- A Reconstruction of Ewens' Sampling Formula via Lists of Coins -- Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof -- Learning Language Intersections -- Runtime verification of compound components with ComMA -- A Basic Compositional Model for Spiking Neural Networks -- State Identification and Verification with Satisfaction -- A Note on the Message Complexity of Cidon's Distributed Depth-First Search Algorithm -- Minesweeper is difficult indeed!- Goodbye ioco -- Process Algebras and Flocks of Birds -- The Integration of Testing and Program Verification -- Discovering Directly-Follows Complete Petri Nets From Event Data -- Fair Must Testing for I/O Automata -- Passive automata learning: DFAs and NFAs.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783031156281
    Weitere Ausg.: Printed edition: ISBN 9783031156304
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    b3kat_BV048524795
    Umfang: xiii, 581 Seiten , Illustrationen, Diagramme
    ISBN: 9783031156281
    Serie: Lecture Notes in Computer Science 13560
    Weitere Ausg.: Erscheint auch als Online-Ausgabe ISBN 978-3-031-15629-8
    Sprache: Englisch
    Schlagwort(e): Festschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783031086281?
Meinten Sie 9783031056581?
Meinten Sie 9783031101281?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz