東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A journey from process algebra via t...

Vaandrager, Frits,

FindBook

Google Book

Amazon

博客來

A journey from process algebra via timed automata to model learning = essays dedicated to Frits Vaandrager on the occasion of his 60th birthday /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A journey from process algebra via timed automata to model learning/ edited by Nils Jansen, Marielle Stoelinga, Petra van den Bos.
其他題名:	essays dedicated to Frits Vaandrager on the occasion of his 60th birthday /
其他作者:	Vaandrager, Frits,
出版者:	Cham :Springer Nature Switzerland : : 2022.,
面頁冊數:	xiii, 581 p. :ill. (some col.), digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Formal methods (Computer science) -
電子資源:	https://doi.org/10.1007/978-3-031-15629-8
ISBN:	9783031156298

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 learningessays dedicated to Frits Vaandrager on the occasion of his 60th birthday /[electronic resource] :edited by Nils Jansen, Marielle Stoelinga, Petra van den Bos. - Cham :Springer Nature Switzerland :2022. - xiii, 581 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,135600302-9743 ;. - Lecture notes in computer science ;13560..

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.

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.

ISBN: 9783031156298

Standard No.: 10.1007/978-3-031-15629-8doiSubjects--Topical Terms:

882407
Formal methods (Computer science)

LC Class. No.: QA76.9.F67 / J68 2022

Dewey Class. No.: 004.0151

A journey from process algebra via timed automata to model learning = essays dedicated to Frits Vaandrager on the occasion of his 60th birthday /
LDR:03661nmm a2200337 a 4500 001 2303913
003 DE-He213
005 20220906102239.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031156298 $q (electronic bk.)
020 $a 9783031156281 $q (paper)
024 7 $a 10.1007/978-3-031-15629-8 $2 doi
035 $a 978-3-031-15629-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.F67 $b J68 2022
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.F67 $b J86 2022
245 0 2 $a A journey from process algebra via timed automata to model learning $h [electronic resource] : $b essays dedicated to Frits Vaandrager on the occasion of his 60th birthday / $c edited by Nils Jansen, Marielle Stoelinga, Petra van den Bos.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2022.
300 $a xiii, 581 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13560
505 0 $a 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.
520 $a 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.
650 0 $a Formal methods (Computer science) $3 882407
650 0 $a Computer science $x Mathematics. $3 532725
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Logic in AI. $3 3386372
650 2 4 $a Natural Language Processing (NLP) $3 3381674
650 2 4 $a Computer System Implementation. $3 892710
700 1 $a Vaandrager, Frits, $e honouree. $3 3605624
700 1 $a Jansen, Nils. $3 3525539
700 1 $a Stoelinga, Marielle. $3 1620255
700 1 $a Bos, Petra van den. $3 3605625
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13560. $3 3605626
856 4 0 $u https://doi.org/10.1007/978-3-031-15629-8
950 $a Computer Science (SpringerNature-11645)