A Journey from Process Algebra via Timed Automata to Model Learning : Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday / edited by Nils Jansen, Mariëlle Stoelinga, Petra van den Bos.

Format:

Book

Contributor:

Stoelinga, Mariëlle, editor.

van den Bos, Petra, editor.

Jansen, Nils, editor.

Series:

Lecture Notes in Computer Science, 1611-3349 ; 13560

Language:

English

Subjects (All):

Computer science.

Software engineering.

Computer engineering.

Computer networks.

Logic programming.

Natural language processing (Computer science).

Computer systems.

Theory of Computation.

Software Engineering.

Computer Engineering and Networks.

Logic in AI.

Natural Language Processing (NLP).

Computer System Implementation.

Local Subjects:

Theory of Computation.

Software Engineering.

Computer Engineering and Networks.

Logic in AI.

Natural Language Processing (NLP).

Computer System Implementation.

Physical Description:

1 online resource (593 pages)

Edition:

1st ed. 2022.

Place of Publication:

Cham : Springer Nature Switzerland : Imprint: Springer, 2022.

Summary:

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.

Contents:

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

ActiveAutomata 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.

Notes:

Includes bibliographical references and index.

Other Format:

Print version: Jansen, Nils A Journey from Process Algebra Via Timed Automata to Model Learning

ISBN:

9783031156298

3031156293