Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
A Journey from Process Algebra Via Timed Automata to Model Learning: Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday

A Journey from Process Algebra Via Timed Automata to Model Learning: Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday

Jansen, Nils
Stoelinga, Mariëlle
Van Den Bos, Petra

Paperback

Series: Lecture Notes in Computer Science, Book 1356

General ComputersProgramming

ISBN10: 3031156285
ISBN13: 9783031156281
Publisher: Springer Nature
Published: Sep 7 2022
Pages: 581
Weight: 1.81
Height: 1.21 Width: 6.14 Depth: 9.21
Language: English
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.

Also from

Jansen, Nils

View All

Also in

General Computers

View All