1  20
Next
 Puppis, Gabriele.
 Berlin ; New York : Springer, ©2010.
 Description
 Book — 1 online resource (x, 206 pages) : illustrations
 Summary

 Word Automata and Time Granularities. Tree Automata and Logics. Summary.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Zhang, JunQi (Professor), author.
 Hoboken, New Jersey : John Wiley & Sons, Inc., [2024]
 Description
 Book — 1 online resource (xvii, 251 pages) : illustrations (chiefly color)
 Summary

 About the Authors ix
 Preface xi
 Acknowledgments xiii
 A Guide to Reading this Book xv
 Organization of the Book xvii
 1 Introduction 1
 1.1 Ranking and Selection in Noisy Optimization 2
 1.2 Learning Automata and Ordinal Optimization 5
 1.3 Exercises 7
 2 Learning Automata 9
 2.1 Environment and Automaton 9
 2.1.1 Environment 9
 2.1.2 Automaton 10
 2.1.3 Deterministic and Stochastic Automata 11
 2.1.4 Measured Norms 15
 2.2 Fixed Structure Learning Automata 16
 2.2.1 Tsetlin Learning Automaton 16
 2.2.2 Krinsky Learning Automaton 18
 2.2.3 Krylov Learning Automaton 19
 2.2.4 IJA Learning Automaton 20
 2.3 Variable Structure Learning Automata 21
 2.3.1 EstimatorFree Learning Automaton 22
 2.3.2 Deterministic Estimator Learning Automaton 24
 2.3.3 Stochastic Estimator Learning Automaton 26
 2.4 Summary 27
 2.5 Exercises 28
 3 Fast Learning Automata 31
 3.1 Lastposition Eliminationbased Learning Automata 31
 3.1.1 Background and Motivation 32
 3.1.2 Principles and Algorithm Design 35
 3.1.3 Difference Analysis 37
 3.1.4 Simulation Studies 40
 3.1.5 Summary 45
 3.2 Fast Discretized Pursuit Learning Automata 46
 3.2.1 Background and Motivation 46
 3.2.2 Algorithm Design of Fast Discretized Pursuit LAs 48
 3.2.3 Optimality Analysis 54
 3.2.4 Simulation Studies 59
 3.2.5 Summary 63
 3.3 Exercises 63
 4 ApplicationOriented Learning Automata 67
 4.1 Discovering and Tracking Spatiotemporal Event Patterns 67
 4.1.1 Background and Motivation 69
 4.1.2 Spatiotemporal Pattern Learning Automata 70
 4.1.3 Adaptive Tunable Spatiotemporal Pattern Learning Automata 73
 4.1.4 Optimality Analysis 76
 4.1.5 Simulation Studies 83
 4.1.6 Summary 89
 4.2 Stochastic Searching on the Line 89
 4.2.1 Background and Motivation 89
 4.2.2 Symmetrical Hierarchical Stochastic Searching on the Line 95
 4.2.3 Simulation Studies 99
 4.2.4 Summary 104
 4.3 Fast Adaptive Search on the Line in Dual Environments 104
 4.3.1 Background and Motivation 109
 4.3.2 Symmetrized ASS with Buffer 111
 4.3.3 Simulation Studies 114
 4.3.4 Summary 118
 4.4 Exercises 118
 5 Ordinal Optimization 123
 5.1 Optimal ComputingBudget Allocation 123
 5.2 Optimal ComputingBudget Allocation for Selection of Best and Worst Designs 125
 5.2.1 Background and Motivation 125
 5.2.2 Approximate Optimal Simulation Budget Allocation 126
 5.2.3 Simulation Studies 138
 5.2.4 Summary 150
 5.3 Optimal ComputingBudget Allocation for Subset Ranking 151
 5.3.1 Background and Motivation 151
 5.3.2 Approximate Optimal Simulation Budget Allocation 153
 5.3.3 Simulation Studies 159
 5.3.4 Summary 167
 5.4 Exercises 167
 6 Incorporation of Ordinal Optimization into Learning Automata 175
 6.1 Background and Motivation 175
 6.2 Learning Automata with Optimal Computing Budget Allocation 178
 6.3 Proof of Optimality 182
 6.4 Simulation Studies 187
 6.5 Summary 193
 6.6 Exercises 193
 7 Noisy Optimization Applications 199
 7.1 Background and Motivation 200
 7.2 Particle Swarm Optimization 202
 7.2.1 Parameters Configurations 203
 7.2.2 Topology Structures 203
 7.2.3 Hybrid PSO 203
 7.2.4 Multiswarm Techniques 204
 7.3 Resampling for Noisy Optimization Problems 204
 7.4 PSOBased LA and OCBA 205
 7.5 Simulations Studies 209
 7.6 Summary 223
 7.7 Exercises 224
 8 Applications and Future Research Directions of Learning Automata 231
 8.1 Summary of Existing Applications 231
 8.1.1 Classification 231
 8.1.2 Clustering 233
 8.1.3 Games 233
 8.1.4 Knapsack Problems 234
 8.1.5 Decision Problems in Networks 235
 8.1.6 Optimization 236
 8.1.7 LA Parallelization and Design Ranking 238
 8.1.8 Scheduling 240
 8.2 Future Research Directions 241
 8.3 Exercises 243
 References 243
 Index 249.
 Esparza, Javier, author.
 Cambridge, Massachusetts : The MIT Press, [2023]
 Description
 Book — 1 online resource : illustrations
 Summary

 Intro
 Title Page
 Copyright Page
 Dedication
 Table of Contents
 Preface
 Why This Book?
 Acknowledgments
 0. Overview
 0.1. Introduction
 0.2. Outline and Structure
 0.3. On the Exercises
 I. Automata on Finite Words
 1. Automata Classes and Conversions
 1.1. Alphabets, Letters, Words, and Languages
 1.2. Regular Expressions: A Language to Describe Languages
 1.3. Automata Classes
 1.3.1. Deterministic Finite Automata
 1.3.2. Using DFAs as Data Structures
 1.3.3. Nondeterministic Finite Automata
 2.3.1. The Reduction Algorithm
 2.3.2. * Minimality Is PSPACEComplete
 2.4. A Characterization of Regular Languages
 2.5. Exercises
 3. Operations on Sets: Implementations
 3.1. Implementation on DFAs
 3.1.1. Membership
 3.1.2. Complementation
 3.1.3. Binary Boolean Operations
 3.1.4. Emptiness
 3.1.5. Universality
 3.1.6. Inclusion
 3.1.7. Equality
 3.2. Implementation on NFAs
 3.2.1. Membership
 3.2.2. Complementation
 3.2.3. Union and Intersection
 3.2.4. Emptiness and Universality
 3.2.5. Inclusion and Equality
 3.2.6. * Universality and Inclusion Are PSPACEComplete
 3.3. Exercises
 4. Application I: Pattern Matching
 4.1. The General Case
 4.2. The Word Case
 4.2.1. Lazy DFAs
 4.3. Exercises
 5. Operations on Relations: Implementations
 5.1. Encodings
 5.2. Transducers and Regular Relations
 5.3. Implementing Operations on Relations
 5.3.1. Projection
 5.3.2. Join, Post and Pre
 5.4. Relations of Higher Arity
 5.5. Exercises
 6. Finite Universes and Decision Diagrams
 6.1. FixedLength Languages and the Master Automaton
 6.2. A Data Structure for FixedLength Languages
 6.3. Operations on FixedLength Languages
 6.4. Determinization and Minimization
 6.4.1. An Application: Equivalence of Digital Circuits
 6.5. Operations on FixedLength Relations
 6.6. Decision Diagrams
 6.6.1. Decision Diagrams and Kernels
 6.6.2. Operations on Kernels
 6.6.3. Determinization and Minimization
 6.7. Exercises
 7. Application II: Verification
 7.1. The AutomataTheoretic Approach to Verification
 7.2. Programs as Networks of Automata
 7.2.1. Parallel Composition of Languages
 7.2.2. Asynchronous Product
 7.2.3. State and ActionBased Properties
 International Colloquium on Automata, Languages, and Programming (18th : 1991 : Madrid, Spain)
 Berlin ; New York : SpringerVerlag, ©1991.
 Description
 Book — 1 online resource (xii, 762 pages) : illustrations
 Summary

 On the semantics of logic programs. Logic programming with recurrence domains. Extensional embedding of a strongly stable model of PCF. Uniform ideals and strictness analysis. Logical and computational aspects of programming with sets/bags/lists. Safety for branching time semantics. Program composition and modular verification. Modelchecking for probabilistic realtime systems. Computing behavioural relations, logically. The power of reconfiguration. General resolution of tseitin formulas is hard. Program checkers for probability generation. Running time to recognize nonregular languages by 2way probabilistic automata. Statistics on random trees. The expressive power of implicit specifications. CCS + time = an interleaving model for real time systems. On confluent semicommutations  Decidability and complexity results. Lazard's factorizations of free partially commutative monoids. A Kleene theorem for infinite trace languages. Canonical sets of horn clauses. A specialized completion procedure for monadic stringrewriting systems presenting groups. A confluent reduction for the ?calculus with surjective pairing and terminal object. Provably recursive programs and program extraction. Efficient algorithms for path problems with general cost criteria. Computing shortest paths and distances in planar graphs. Maintaining biconnected components of dynamic planar graphs. Efficient maximal cubic graph cuts. Structural parallel algorithmics. Improving known solutions is hard. Collapsing degrees via strong computation. Fast parallel generation of random permutations. A parallel algorithm for two processors precedence constraint scheduling. An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs. On logics, tilings, and automata. Satisfiability of systems of ordinal notations with the subterm property is decidable. Complete axiomatizations of some quotient term algebras. The meaning of negative premises in transition system specifications. Deciding history preserving bisimilarity. Adding action refinement to a finite process algebra. Improved parallel computations with matrices and polynomials. Finding minimal forbidden minors using a finite congruence. Better algorithms for the pathwidth and treewidth of graphs. Two Pcomplete problems in the theory of the reals. L morphisms: Bounded delay and regularity of ambiguity. Degree and decomposability of variablelength codes. An EILENBERG theorem for ?languages. Balancing order and chaos in image generation. Average case complexity. Minimal NFA problems are hard. Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language. Computing shortest transversals. Ray shooting in polygons using geodesic triangulations. The expected extremes in a delaunay triangulation. Computational geometry for the gourmet old fare and new dishes. On the power of multiple reads in a chip. On linear decision trees computing Boolean functions. An almost lineartime algorithm for the dense subsetsum problem. Online algorithms for weighted bipartite matching and stable marriages. String matching with preprocessing of text and pattern. Ordering problems approximated: singleprocessor scheduling and interval graph completion.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 CIAA (Conference) (14th : 2009 : University of New South Wales)
 Berlin ; New York : Springer, ©2009.
 Description
 Book — 1 online resource (xi, 261 pages) : illustrations
 Summary

 Invited Lectures. Implementation and Application of Automata in String Processing. Applications of Automata in XML Processing. Program Analysis through Finite Tree Automata. Technical Contributions. An nlogn Algorithm for Hyperminimizing States in a (Minimized) Deterministic Automaton. On Extremal Cases of Hopcroft's Algorithm. Compact Normal Form for Regular Languages as Xor Automata. Cellular Automata with Sparse Communication. A Cellular Automaton Model for Car Traffic with a SlowtoStop Rule. On Parallel Implementations of Deterministic Finite Automata. FAdo and GUItar. A Testing Framework for FiniteState Morphology. A Table Compression Method for Extended AhoCorasick Automaton. Compact Representation for Answer Sets of nary Regular Queries. Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata. Random Generation of Deterministic Tree (Walking) Automata. Hedge Pattern Partial Derivative. TAGED Approximations for Temporal Properties ModelChecking. Verifying Parallel Programs with Dynamic Communication Structures. Fixpoint Guided Abstraction Refinement for Alternating Automata. AutomataBased Termination Proofs. Implementation of State Elimination Using Heuristics. Short Regular Expressions from Finite Automata: Empirical Results. Small Extended Expressions for Acyclic Automata. Quantum Queries on Permutations with a Promise. TimeOptimal Winning Strategies for Poset Games. Amount of Nonconstructivity in Finite Automata. Short Papers and Poster Abstracts. Multiflex: A Multilingual FiniteState Tool for MultiWord Units. Efficient Parsing Using FilteredPopping Recursive Transition Networks. Forest FIRE: A Taxonomybased Toolkit of Tree Automata and Regular Tree Algorithms. Formally Synthesising a Protocol Converter: A Case Study. Compiler Generator Based on Restarting Automata. Are Statecharts Finite Automata?.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 CIAA (Conference) (13th : 2008 : San Francisco, Calif.)
 Berlin ; New York : Springer, ©2008.
 Description
 Book — 1 online resource (xiii, 287 pages) : illustrations Digital: text file.PDF.
 Summary

 Invited Lectures
 Nondeterministic Finite AutomataRecent Results on the Descriptional and Computational Complexity
 Language Decompositions, Primality, and TrajectoryBased Operations
 Automata, Probability, and Recursion
 Concurrency, Synchronization, and Conflicts in Petri Nets
 Technical Contributions
 Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
 Antimirov and Mosses's Rewrite System Revisited
 AntichainBased Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
 Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
 Hopcroft's Minimization Technique: Queues or Stacks?
 Learning Regular Languages Using Nondeterministic Finite Automata
 MultiReturn Macro Tree Transducers
 Computing Convex Hulls by Automata Iteration
 A Translation from the HTML DTD into a Regular Hedge Grammar
 TreeSeriestoTreeSeries Transformations
 AutomataTheoretic Analysis of BitSplit Languages for Packet Scanning
 Pattern Matching in DCA Coded Text
 Five Determinisation Algorithms
 Persistent Computations of Turing Machines
 On Complexity of Two Dimensional Languages Generated by Transducers
 Games for Temporal Logics on Trees
 A RunTime Efficient Implementation of Compressed Pattern Matching Automata
 Composed Bisimulation for Tree Automata
 HyperMinimization in O(n 2)
 Deterministic Pushdown Automata and Unary Languages
 Finite Eilenberg Machines
 The Number of Runs in Sturmian Words
 3Way Composition of Weighted FiniteState Transducers
 Progressive Solutions to FSM Equations
 Combination of ContextFree Grammars and Tree Automata for Unranked and Ranked Trees
 Approximate Periods with Levenshtein Distance.
 Kandar, Shyamalendu.
 New Delhi, India : Dorling Kindersley (India), ©2013.
 Description
 Book — 1 online resource (1 volume) : illustrations
9. Handbook of weighted automata [2009]
 Berlin : Springer, ©2009.
 Description
 Book — 1 online resource (xvii, 608 pages) : illustrations Digital: text file.PDF.
 Summary

 Part I, Foundations: Semirings and Formal Power Series. Fixed Point Theory. Part II, Concepts of Weighted Recognizability: Finite Automata. Rational and Recognisable Power Series. Weighted Automata and Weighted Logics. Weighted Automata Algorithms. Part III, Weighted Discrete Structures: Algebraic Systems and Pushdown Automata. Lindenmayer Systems. Weighted Tree Automata and Tree Transducers. Traces, SeriesParallel Posets, and Pictures: A Weighted Study. Part IV, Applications: Digital Image Compression. Fuzzy Languages. Model Checking LinearTime Properties of Probabilistic Systems. Applications of Weighted Automata in Natural Language Processing. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Parkes, Alan.
 London : Springer, ©2008.
 Description
 Book — 1 online resource (vii, 343 pages) : illustrations Digital: text file.PDF.
 Summary

 Introduction. Part One: Languages and Machines. Elements of Formal Languages. Syntax, Semantics and Ambiguity. Regular Languages and Finite State. Context Free Languages and Pushdown Recognisers. Important Features of Regular and Context Free Languages. Phrase Structure Languages and Turing Machines. Part Two: Machines and Computation. Finite State Transducers. Turing Machines as Computers. Turing's Thesis and The Universality of the Turing Machine. Computability, Solvability and the Halting Problem. Dimensions of Computation. Further Reading. Solutions to Selected Exercises.
 (source: Nielsen Book Data)
 Kluge, Werner (Werner E.)
 Berlin ; New York : Springer, ©2005.
 Description
 Book — 1 online resource (xiv, 384 pages) : illustrations Digital: text file.PDF.
 Summary

 Algorithms and Programs. An Algorithmic Language. The ?Calculus. The se(m)cd Machine and Others. Toward FullFledged ?Calculus Machines. Interpreted HeadOrder Graph Reduction. The BMachine. The GMachine. The ?red Machinery. Pattern Matching. Another Functional Abstract Machine. Imperative Abstract Machines. Real Computing Machines.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 CIAA (Conference) (25th : 2021 : Online)
 Cham : Springer, [2021]
 Description
 Book — 1 online resource : illustrations (some color)
 Summary

 Polyregular Functions. Back to the Future: A Fresh Look at Linear Temporal Logic. Say No to Case Analysis: Automating the Drudgery of CaseBased Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. Memoized Regular Expressions. The Commutative Closure of Shuffle Languages over Group Languages is Regular. Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis. Degrees of Restriction for TwoDimensional Automata. The Range of State Complexities of Languages Resulting from the Cascade ProductThe Unary Case (Extended Abstract)
 Guessing the Buffer Bound for kSynchronizability. The Commutative Closure of Shuffle Languages over Group Languages is Regular. Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. Ambiguity Hierarchies for Weighted Tree Automata. Boolean Kernels of ContextFree Languages. Efficient String Matching Based on a TwoStep Simulation of the Suffix Automaton. Approximate Hashing for Bioinformatics.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Issledovanii͡a po teorii avtomatov i modelirovanii͡u biologicheskikh sistem. English
 T͡Setlin, Mikhail Lʹvovich, 19241966.
 New York, Academic Press, 1973.
 Description
 Book — 1 online resource (xvi, 288 pages) illustrations
 Summary

 pt. 1. Automaton theory
 pt. 2. Articles on biological systems and mathematical models in biology
 pt. 3. Supplementary articles.
 Dehmer, Matthias, 1968
 Hoboken, N.J. : Wiley, 2012.
 Description
 Book — 1 online resource Digital: data file.
 Summary

 Chapter 1. A Survey of Computational Approaches to Reconstruct and Partition Biological Networks Acharya et al.
 Chapter 2. Introduction to Complex Networks: Measures, Statistical Properties, and Models Takemoto et al.
 Chapter 3. Modeling for Evolving Biological Networks Takemoto et al.
 Chapter 4. Modularity Configurations in Biological Networks with Embedded Dynamics Capobianco et al.
 Chapter 5. Influence of Statistical Estimators on the Large Scale Causal Inference of Regulatory Networks Matos de Simoes and EmmertStreib
 Chapter 6. Weighted Spectral Distribution: A Metric for Structural Analysis of Networks Fay, Haddadi et al.
 Chapter 7. The Structure of an Evolving Random Bipartite Graph Kutzelnigg
 Chapter 8. Graph Kernels Rupp
 Chapter 9. Networkbased information synergy analysis for Alzheimer disease Wang, Geekiyanage and Chan
 Chapter 10. DensityBased Set Enumeration in Structured Data Georgii and Tsuda
 Chapter 11. Hyponym Extraction Employing a Weighted Graph Kernel Vor der Bruck.
 (source: Nielsen Book Data)
 Preface ix Contributors xi
 1 A Survey of Computational Approaches to Reconstruct and Partition Biological Networks 1 Lipi Acharya, Thair Judeh, and Dongxiao Zhu
 2 Introduction to Complex Networks: Measures, Statistical Properties, and Models 45 Kazuhiro Takemoto and Chikoo Oosawa
 3 Modeling for Evolving Biological Networks 77 Kazuhiro Takemoto and Chikoo Oosawa
 4 Modularity Configurations in Biological Networks with Embedded Dynamics 109 Enrico Capobianco, Antonella Travaglione, and Elisabetta Marras
 5 Influence of Statistical Estimators on the LargeScale Causal Inference of Regulatory Networks 131 Ricardo de Matos Simoes and Frank EmmertStreib
 6 Weighted Spectral Distribution: A Metric for Structural Analysis of Networks 153 Damien Fay, Hamed Haddadi, Andrew W. Moore, Richard Mortier, Andrew G. Thomason, and Steve Uhlig
 7 The Structure of an Evolving Random Bipartite Graph 191 Reinhard Kutzelnigg
 8 Graph Kernels 217 Matthias Rupp
 9 NetworkBased Information Synergy Analysis for Alzheimer Disease 245 Xuewei Wang, Hirosha Geekiyanage, and Christina Chan
 10 DensityBased Set Enumeration in Structured Data 261 Elisabeth Georgii and Koji Tsuda
 11 Hyponym Extraction Employing a Weighted Graph Kernel 303 Tim vor der Bruck Index 327.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Explore the multidisciplinary nature of complex networks through machine learning techniques Statistical and Machine Learning Approaches for Network Analysis provides an accessible framework for structurally analyzing graphs by bringing together known and novel approaches on graph classes and graph measures for classification. By providing different approaches based on experimental data, the book uniquely sets itself apart from the current literature by exploring the application of machine learning techniques to various types of complex networks. Comprised of chapters written by internationally renowned researchers in the field of interdisciplinary network theory, the book presents current and classical methods to analyze networks statistically. Methods from machine learning, data mining, and information theory are strongly emphasized throughout. Real data sets are used to showcase the discussed methods and topics, which include: * A survey of computational approaches to reconstruct and partition biological networks * An introduction to complex networks measures, statistical properties, and models * Modeling for evolving biological networks * The structure of an evolving random bipartite graph * Densitybased enumeration in structured data * Hyponym extraction employing a weighted graph kernel Statistical and Machine Learning Approaches for Network Analysis is an excellent supplemental text for graduatelevel, crossdisciplinary courses in applied discrete mathematics, bioinformatics, pattern recognition, and computer science. The book is also a valuable reference for researchers and practitioners in the fields of applied discrete mathematics, machine learning, data mining, and biostatistics.
(source: Nielsen Book Data)
15. Descriptive set theoretic methods in automata theory : decidability and topological complexity [2016]
 Skrzypczak, Michał, author.
 Berlin : Springer, 2016.
 Description
 Book — 1 online resource (xiii, 211 pages) : illustrations Digital: text file.PDF.
 Summary

 Subclasses of regular languages
 Thin algebras
 Extensions of regular languages.
16. Advances in Petri Nets, 1992 [1992]
 Berlin ; New York : SpringerVerlag, ©1992.
 Description
 Book — 1 online resource (viii, 472 pages) : illustrations
 Summary

 Esprit basic research action 3148 DEMON (Design methods based on nets)
 Aims, scope and achievements
 The box calculus: A new causal algebra with multilabel communication
 Modular functional modelling of petri nets with individual tokens
 Interleaving semantics and action refinement with atomic choice
 Maximality preservation and the STidea for action refinements
 A fifonet model for processes with asynchronous communication
 A basicnet algebra for program semantics and its application to occam
 The effect of Vector synchronization: Residue and loss
 Modelling systems with dynamic priorities
 On distributed languages and models for concurrency
 Partial words versus processes: A short comparison
 A survey of basic net models and modular net classes
 Structural techniques and performance bounds of stochastic Petri net models
 A survey of recognizable languages of infinite traces
 A survey of equivalence notions for net based systems.
17. Automata theory and formal languages [2012]
 Kandar, Shyamalendu.
 New Delhi : Dorling Kindersley (India), ©2012.
 Description
 Book — 1 online resource (1 volume) : illustrations.
 ABZ (Conference) (8th : 2021 : Online)
 Cham : Springer, [2021]
 Description
 Book — 1 online resource : illustrations (chiefly color) Digital: text file.PDF.
 Summary

 Regular Research Articles. Unbounded BarrierSynchronized Concurrent ASMs for Effective MapReduce Processing on Streams. Towards ASMbased automated formal verification of security protocols. Verifying Systemlevel Security of a Smart Ballot Box. Proving the safety of a Sliding Window Protocol with Event B. EventB formalization of EventB contexts. Validation of Formal Models by Timed Probabilistic Simulation. Short Articles. Sterling: A Webbased Visualizer for Relational Modeling Languages. Extending ASMETA with time features. About the Concolic Execution and Symbolic ASM Function Promotion in CASM. Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency and Reflection. The CamilleX Framework for the Rodin Platform. Extensible Record Structures in EventB. Formalizing and Analyzing System Requirements of Automatic Train Operation over ETCS using EventB. Automatic Transformation of SysML Model to EventB Model for Railway CCS Application. Short Articles of the PhDSymposium (Work in Progress). Formal Meta Engineering EventB: Extension and Reasoning  The EB4EB Framework. A modeling and verification framework for security protocols. Formalizing the Institution for EventB in the Coq Proof Assistant.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 ABZ (Conference) (6th : 2018 : Southampton, England)
 Cham, Switzerland : Springer, 2018.
 Description
 Book — 1 online resource (xiv, 432 pages) : illustrations Digital: text file.PDF.
 Summary

 Invited Talks. Translation and Transformation. Analysis and Tests. Reals and Hybrid Systems.
 Refinement. Hybrid ERTMS Case Study. Short Papers.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
20. Algebraic theory of automata [1968]
 Ginzburg, Abraham.
 New York, Academic Press, 1968.
 Description
 Book — 1 online resource (ix, 165 pages) illustrations
 Summary

 Algebraic preliminaries
 Semiautomata
 Recognizer (RabinScott automata)
 Regular expressions
 Coverings of automata
 Covering by permutation and reset semiautomata
 The theory of Krohn and Rhodes.
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.