001449487 000__ 04774cam\a2200541\i\4500
001449487 001__ 1449487
001449487 003__ OCoLC
001449487 005__ 20230310004403.0
001449487 006__ m\\\\\o\\d\\\\\\\\
001449487 007__ cr\un\nnnunnun
001449487 008__ 220913s2022\\\\sz\\\\\\o\\\\\011\0\eng\d
001449487 019__ $$a1343999879$$a1344158919
001449487 020__ $$a9783031156298$$q(electronic bk.)
001449487 020__ $$a3031156293$$q(electronic bk.)
001449487 020__ $$z9783031156281
001449487 0247_ $$a10.1007/978-3-031-15629-8$$2doi
001449487 035__ $$aSP(OCoLC)1344336231
001449487 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dOCLCF$$dOCLCQ$$dUKAHL
001449487 049__ $$aISEA
001449487 050_4 $$aQA76.9.F67
001449487 08204 $$a004.01/51$$223/eng/20220913
001449487 24502 $$aA journey from process algebra via timed automata to model learning :$$bessays dedicated to Frits Vaandrager on the occasion of his 60th birthday /$$cNils Jansen, Mariëlle Stoelinga, Petra van den Bos (eds.).
001449487 264_1 $$aCham, Switzerland :$$bSpringer,$$c2022.
001449487 300__ $$a1 online resource (xiii, 581 pages) :$$billustrations (some color).
001449487 336__ $$atext$$btxt$$2rdacontent
001449487 337__ $$acomputer$$bc$$2rdamedia
001449487 338__ $$aonline resource$$bcr$$2rdacarrier
001449487 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13560
001449487 500__ $$aIncludes author index.
001449487 5050_ $$aNon-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.
001449487 506__ $$aAccess limited to authorized users.
001449487 520__ $$aThis 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.
001449487 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 13, 2022).
001449487 650_0 $$aFormal methods (Computer science)
001449487 650_0 $$aComputer science$$xMathematics.
001449487 655_0 $$aElectronic books.
001449487 7001_ $$aVaandrager, Frits,$$ehonouree.
001449487 7001_ $$aJansen, Nils$$c(Professor of Software Science),$$eeditor.$$1https://orcid.org/0000-0003-1318-8973
001449487 7001_ $$aStoelinga, Mariëlle,$$eeditor.$$1https://orcid.org/0000-0001-6793-8165
001449487 7001_ $$aBos, Petra van den,$$eeditor.
001449487 77608 $$iPrint version:$$aJansen, Nils$$tA Journey from Process Algebra Via Timed Automata to Model Learning$$dCham : Springer,c2022$$z9783031156281
001449487 830_0 $$aLecture notes in computer science ;$$v13560.$$x1611-3349
001449487 852__ $$bebk
001449487 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-15629-8$$zOnline Access$$91397441.1
001449487 909CO $$ooai:library.usi.edu:1449487$$pGLOBAL_SET
001449487 980__ $$aBIB
001449487 980__ $$aEBOOK
001449487 982__ $$aEbook
001449487 983__ $$aOnline
001449487 994__ $$a92$$bISE