Computer Aided Systems Theory - EUROCAST 2001: A Selection of Papers from the 8th International Workshop on Computer Aided Systems Theory, Las Palmas ... (Lecture Notes in Computer Science, 2178)

The concept of CAST as Computer Aided Systems Theory, was introduced by F. Pichler in the late 1980s to include those computer theoretical and practical developments as tools to solve problems in System Science. It was considered as the third component (the other two being CAD and CAM) necessary to build the path from Computer and Systems Sciences to practical developments in Science and Engineering. The University of Linz organized the first CAST workshop in April 1988, which demonstrated the acceptance of the concepts by the scientific and technical community. Next, the University of Las Palmas de Gran Canaria joined the University of Linz to organize the first international meeting on CAST, (Las Palmas, February 1989), under the name EUROCAST’89. This was a very successful gathering of systems theorists, computer scientists, and engineers from most European countries, North America, and Japan. It was agreed that EUROCAST international conferences would be organized every two years, alternating between Las Palmas de Gran Canaria and a continental European location. Thus, successive EUROCAST meetings have taken place in Krems (1991), Las Palmas (1993), Innsbruck (1995), Las Palmas (1997), and Vienna (1999), in addition to an extra-European CAST Conference in Ottawa in 1994. Computer Aided Systems Theory - EUROCAST 2001 Preface Table of Contents Gröbner Bases: A Short Introduction for Systems Theorists 1 Motivation for Systems Theorists 2 Why is Gröbner Bases Theory Attractive? 3 What is the Purpose of Gröbner Bases Theory? 4 How Can Gröbner Bases Theory be Applied? 5 What are Gröbner Bases? 5.1 Division ("Reduction") of Multivariate Polynomials 5.2 In General, Many Reductions are Possible 5.3 Multivariate Polynomial Division Always Terminates But is Not Unique 5.4 Definition of Gröbner Bases 5.5 The "Application Theory of Gröbner Bases" 6 How Can GB be Constructed? 6.1 The Main Problem 6.2 An Algorithm 6.3 S
Polynomials 6.4 Specializations 7 Why Does This Work? 7.1 Termination of the Algorithm 7.2 Correctness of the Algorithm 8 Examples 8.1 A Simple Set of Equations 8.2 A More Complicated Set of Equations 8.3 Algebraic Relations 9 How Difficult is it to Construct Gröbner Bases? Very Easy Very Difficult Sometimes Easy Enormous Potential for Improvement 10 Why are Gröbner Bases Called Gröbner Bases? 11 Where Can You Find Information on Gröbner Bases? 11.1 The Gröbner Bases Conference 1998 11.2 On Your Desk 11.3 In Your Palm 11.4 Textbooks 11.5 In the Web 11.6 Original Publications References Design for Reuse via Structuring Techniques for ASMs The Method: Structuring ASMs by Submachines The Java/JVM Modeling and Analysis Problem Decomposition of Java/JVM into Components On CAST.FSM Computation of Hierarchical Multi-layer Networks of Automata Implementation of CAST.FSM in ANSI Common Lisp Hierarchical Models of A. Koestler (Holarchies) The Multi-strata and the Multi-layer Representation of a FSM's Parallel Decomposition Realization of a Hierarchical Representation of a FSM by winCASTfsm Conclusion References A Holarchical Organized Design Assistant for Hierarchical Decompositions Holons and Holarchies Holarchies Extensions Organization of a Design Assistant as a Holarchy Formula Decomposition Automata Decomposition Conclusion Arthur Koestlerxspace : Life and Work References Conflict Management in an Intelligent Multiagent Robotic System Based on FSM Approach Introduction Multiagent Robotic System Intelligent Robotic Agent Knowledge Base Safety Protection Component of $i-$th Agent Action Planning of Multiagent Robotic System State Feasibility: Static and Dynamic Constraints Strategies of Searching of Safe Actions of Robotic Agent Group Conflict Management in Multiagent Robotic System N-step Delay - Sequential Synchronization of Actions of Agent Group Action Planning and Action Execution Component of $i-$th Agent Conflict Avoidance Algorithm An Example References Computer-Aided Simulations of Gaussian Processes and Related Asymptotic Properties Introduction The Simulation Procedure The Asymptotic Behavior of Estimated FPT Density Hybrid Systems' Properties - Classification and Relation to Computer Science Introduction Systems under Consideration Properties Robustness Optimality Stability Attraction Further Properties Classification of the Properties and Its Consequences Some Proof Concepts State-Based Stability via Liapunov Functions Liapunov Functions and Galois Connections Discussion and Further Work References Some Topology Assertion-Based Analysis of Hybrid Systems with PVS Introduction The PVS Theorem Prover Hybrid Systems Basic Definitions Semantics The Parallel Composition of Hybrid Systems Proof System Inductive Assertional Method Inductive Assertional Proofs for Parallel Composition Verification in PVS Structure of the Proof System in PVS Example Conclusion References Algebraic Description of Physical Systems 1 Introduction 2 Akton Algebra 3 The Two Mappings from Space to AA 4 Physical Structures 5 Data Processing Systems 6 Semantical Distance to Conventional Systems 7 Conversions to and from Programming Languages and Algebras 8 Final Remarks and Future Work References Information Structure and Logical Design of Social Rules Introduction The Agent ; as a Player in Games Game and Its Model Structure of Players Conclusion: Perspective and Direction Around Backward Induction Process: In a Game and in the Iteration of the Game Direction References Towards a Generic Model of Information Processing Systems 1 Introduction 2 Basic Concepts and Definitions 3 Knowledge Representation References Evolutionary Information and Decision Support Systems: An Integration Based on Ontologies 1 Introduction 2 Information Integration through Semantic Views 3 Formalisms Used in Obtaining Semantic Views 4 Understanding Ontologies 5 Using Application Ontologies to the DSS Domain 6 Limitation of the Description Logic in the Complex Domain 7 The Evolution Problem in the Integration Framework 7.1 A Specialized Ontology Based on the Object Model 7.2 Facing the Evolution 7.3 Graphical Approach 8 Conclusions References A Proposal for Project Management Using CommonKADS 1 Introduction 2 Survey of Knowledge Engineering 2.1 Historical Review 2.2 Relationships between Software Engineering and Knowledge Engineering 3 CommonKADS Methodology 3.1 Modeling Approach 3.2 Lifecycle and Project Management 4 Spiral Development in CommonKADS 4.1 Brief Description of Spiral Model 4.2 Proposal of Lifecycle 5 Practical Application 6 Conclusions References A General Planning Method for Allocation of Human Resource Groups Introduction Basic Model Planning Methodology The Local Optimizer (LocOpt) The Global Optimizer (GlobOpt) The Strategic Optimizer (StratOpt) Conclusion References Optimizing Organizational Structure: A Hausdorff Benchmark for Complex Social Systems 1 The Question and Traditional Ways of Dealing with It 2 Idea for an Innovative Approach and Hypothesis 3 Test of Hypothesis 3.1 Setup 3.2 Structural Architecture of Team Syntegrity 3.3 Calculus of the Dimensionality of the Team Syntegrity Architecture 3.4 The Revised Theorem 3.5 Discussion 4 Sensitivity Analysis 5 Synopsis and Outlook Acknowledgements References A Planning under Uncertainty Model 1 Introduction 2 The Ex Post and Ex Ante Approaches 3 The Meta Ontological Commitments 4 The Ontological Level 4.1 The Planning Problem 4.2 World Description 4.3 Plan Description 4.4 The Planning Task 5 The Epistemological Level 6 The Logical Level 7 Conclusions References Knowledge Based Modeling of the Design Process as a Base of Design Tools. Application to the Development of Agricultural Structures 1 Introduction 2 STE Design Model 3 Dynamic Selection of Methods 4 Case Application 5 Conclusions and Further Works References Complexity Analysis of Systems from a Functional and Technical Viewpoint What Is Complexity and What Are Its Characteristics? What Are the Criteria for a Good Method to Evaluate Complexity? How Could Complexity Be Evaluated? Existing Complexity Values – Results of Literature-Study Own Complexity Values Functional Product Complexity (FPCI). Reliability Product Complexity (RPCI). Summary References A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength Cryptographic Measures of Complexity Linear Complexity Quadratic Span Maximum Order Complexity Entropy Lempel-Ziv Complexity Kolmogoroff Complexity Other Measures Sequence Complexity Hierarchy Optimal Cryptographic Measures of Complexity Cellular Automata as PRSG Closing Remarks References Characterizing the Software Development Process: A New Approach Based on Kolmogorov Complexity Introduction Kolmogorov Complexity About Program Length The Reference Machine Universal Method as an Objective Notion Acceptable Numberings Choosing the Programming Language Dealing with Modules Computing Kolmogorov Complexity Incompleteness of Formal Methods Software Development Predictability Software Development: Art, Engineering, or Science? Conclusions References Application of Signed Kolmogorov Hashes to Provide Integrity and Authenticity in Web-Based Software Distribution Introduction Chaotic Kolmogorov Systems Continuous Kolmogorov Systems Discrete Kolmogorov Systems Properties of Cryptographic Relevance Conclusion Permutation Hashes Based on Chaotic Kolmogorov Systems Security Analysis Quantitative Security Analysis Conclusion References Toward a Formalisation of Evolutionary Hypermedia Systems Based on System Theory 1 Introduction 2 Architecture of Evolutionary Hypermedia Systems 3 The Conceptual Perspective of the SEM-HP 3.1 Information Items 3.2 Conceptual Structure 3.3 Restrictions 3.4 Evolving Actions 4 The Systems of the SEM-HP 4.1 Knowledge System 4.2 Navigation System 4.3 Learning System 5 The SEM-HP Systems Functionality and Evolution 6 Conclusions and Further Work References Appendix: Glossary Optimization Problems Categories Introduction Preliminaries Optimization Problem NPO Class Performance Ratio and Relative Error Approximation Algorithm Approximation Scheme Approximation Problem Approximation Classes Mathematical Foundations Category Functor Comma Category Universality Optimization Problems Category Approximation Problems Category OPT Category $times $ APX Category Conclusions Acknowledgments References Systems Methodology for Classical Neural Nets at Various Levels Introduction Neuron-like Analysis and Synthesis of Arbitrary Automata Nets to Integrate Sensory, Intermodal, and Effector Functions Intermodal Transformations Modules for Some Robotics Systems References Biologically Based CAST-mechanism for Visual Motion Analysis 1 Introduction 2 Mathematical Model 2.1 Center of Gravity 2.2 Size 2.3 Motion 3 System Description, Setup and Results 3.1 The Visual Environment 3.2 Results on Size and Speed Estimation 3.3 The Effect of Varying the Number of Cells 4 Bases of a Pre-attentive Model. Formal Considerations 5 Conclusions References Towards a Model of Volume Transmission in Biological and Artificial Neural Networks: A CAST Approach Introduction NO Diffusion Computational Model: A CAST Approach Implications in Neural Networks Diffusion Associative Network (DAN) Results Conclusions References An Online Information Retrieval Systems by Means of Artificial Neural Networks 1 Introduction 2 Information Retrieval Techniques 3 Artificial Neural Networks for Classification 4 Proposed Example 4.1 Radial Basis Networks 4.2 Multilayer Perceptrons 4.3 Data Used 4.4 Discussion of Results 5 Conclusions References Kinematics in Robotics by the Morphogenetic Neuron 1 Introduction 2 Morphogenetic Neuron 3 Context Determination by Morphogenetic Neuron 4 Horthogonality of Basic Functions and Scalar Product 4.1 Scalar Product and Context 4.2 Example 4.3 Numerical Example 5 Invariants and Basic Tensor 5.1 Example 6 Learning Process and Fundamental Tensor gi,k Construction 7 Biological Realisation of the Scalar Product and of the Filter Process 8 Biological Analogy of the Basic Function Approach 8.1 Population Code and Basic Functions 9 Kinematics Synthesis and Analysis in Robotics 10 Hints about the Kinematics Problem in Robotics 11 Application to a SCARA Robot 12 Application to a Spherical Robot References Analysis and Verification Queries over Object-Oriented Petri Nets Introduction Key Concepts of OOPNs The Structure of OOPNs The Dynamic Behaviour of OOPNs The Notion of State Spaces of OOPNs Using State Spaces of OOPNs Instances and Their Behaviour in Time Statistics of State Spaces of OOPNs Querying States Spaces of OOPNs Instrumenting OOPNs High-Level Specification Languages and OOPNs Conclusions Acknowledgment. References Integrated Design and Implementation of Digital Controllers Introduction Delay Effects on the Control Control Implementation Issues Integrated Design Conclusions References Symbolic Computation Tools for Dynamical Nonlinear Control Systems 1 Introduction 2 The Two-Blocks Decomposition Approach 3 Series-Parallel Compensation 4 A Case Study: The Centrifugal Pendulum in WattTMs Governor 5 Discussion References Integrated Symbolic-Graphic-Numeric Analysis and Design in Nonlinear Control Through Notebooks in Mathematica 1 Introduction 2 Integrated Analysis of Nonlinear Dynamical Systems 3 Integrated Design of Nonlinear Dynamical Control Systems 4 Perspective and Future Work References Towards a Computer-Aided Design of Reactive Systems Introduction Overview of the Method and Major Issues Representation of Reactive Programs Transformations Sound Abstraction An Illustrative Example Computational Complexity Outline of a Solution Design Exploration by Means of Synthesis Approach Preliminary Definitions Transformations Preserving Correctness Summary of Transformation Characteristics Conclusion References Contributions to the Control and Stabilization of the Pole-Cart System 1 Introduction 2 Stabilization of the Pole-Cart System in the Continuous-Time Domain 3 Experimentation via Computer Simulations 3.1 Ideal Pole-Cart System Simulation. 3.2 Simulation of the Computer-Based Pole-Cart System 4 Conclusions References A Qualitative System as a Frame to Control Unmanned Vehicles Introduction Kinematic Foundations Qualitative Model Control Model Implementation Experiments and Results References Acknowledge Hyper-Automaton System Applied to Geometry Demonstration Environment Introduction Hyper-Automaton Learning Environment on Euclidean Geometry Modelling the Interaction Modelling the Knowledge Base Concluding Remarks References The PCS Prover in THEOREMAV 1 Introduction 2 THEOREMA 3 Mathematical Texts in THEOREMA 4 The PCS Proving Method 4.1 An Overview on the PCS Method 4.2 A Proof Generated by the PCS Prover 4.3 The Essential Ideas of the PCS Method 5 Conclusion References Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations Introduction Preliminaries The Calculus HOLN Inference Rules of HOLN Main Property Refinements of HOLN ensuremath {unhbox voidb @x hbox {rm HOLN}_{1}}: Refinement for Left-Linear EPRSs ensuremath {unhbox voidb @x hbox {rm HOLN}_{2}}: Refinement for Constructor LEPRSs Extensions of the Computational Model of HOLN Application Conclusions and Future Work Acknowledgements. References Classifying Isomorphic Residue Classes Introduction Proof Planning and Computer Algebra Multi-strategy Proof Planning Using Computer Algebra in Proof Planning Checking Simple Properties Identifying Classes of Isomorphic Structures Isomorphism Proofs Non-isomorphism Proofs Experiments and Results Related Work and Conclusions References CAL: A Computer Assisted Learning System for Computation and Logic Introduction Theory of Expressions Definition Games Expressions Derivation Games Derivation Games in General Propositional Logic Simply Typed Lambda Calculus Computational Aspect of Logic Heyting Arithmetic CAL System User Interface Parser Checker Conclusion References A Set Theory Prover Within Theorema 1 Introduction 2 The P C S Paradigm for Theorema Provers 3 Provers in Theorema 4 The Set Theory PCS Prover 5 System Demonstration 5.1 General Outline of the Case Study 5.2 Computing 5.3 Computing Í Proving 5.4 Computing Ì Proving 5.5 Solving چ Proving 5.6 Computing U Solving چ Proving Comments on the Method 6 Conclusion References The Tertiary Level in a Functional Cluster-Based Hierarchical VoD Server Introduction: What Is a VoD System? State of the Art A Functional Cluster Based VoD System VoD Server Hierarchy: Hardware Layout Target Architecture: Prototype Beowulf Cluster Erlang: A Concurrent Functional Programming Language The Tertiary Level Scheduling Subsystem Input/Output Subsystem Supervision Subsystem (Monet and Erlatron) Conclusions and Future Work References Hidden Specification of a Functional System Introduction Examples An Institutional Approach Putting Together Different Algebraic Structures Conclusions and Future Work References Distributed Execution of Functional Programs Using the JVM Introduction Running Functional Programs on the JVM Distributed Execution of Functional Programs on the JVM Parallel Combinators How Does the Distributed Execution Works? Implementing the Parallel Combinator Starting the Distributed Functional Environment Implementing the Distributed Execution Benchmarks Discussion Related Works Conclusions References Fusion in Coq Introduction Categorical Interpretacion of Inductive Types The Type {tt nat} The Type {tt list} Fusion on Lists Generalised Fusion Theorem An Example Conclusions and Future Work References A Language Prototyping Tool Based on Semantic Building Blocks Introduction Modular Monadic Semantics Extensible Domains Generic Programming Concepts Functors, Algebras, and Catamorphisms Many-Sorted Algebras and Catamorphisms From Functors to Bifunctors Specification of a Simple Imperative Language Abstract Syntax Computational Structure Semantic Functions Conclusions and Future Work References Verifying an Applicative ATP Using Multiset Relations Introduction Formalization of Multiset Relations in ACL2 Formalization of Well-Founded Multiset Relations in ACL2 A Proof of Well-Foundedness of the Multiset Relation The {tt defmul} Macro An Applicative ATP for Propositional Logic Formalization of Propositional Logic and Uniform Notation Semantic Tableau as Rules of Transformation ACL2 Definition of a Semantic Tableau Prover Termination of {tt closed-tableau} Conclusions References Adding Traces to a Lazy Monadic Evaluator Introduction A Lazy Evaluator Based on Sestoft's Abstract Machine The Language A Non-monadic Evaluator A Monadic Evaluator Specific Functions for RTS Traces The RTS Browser Specific Functions for EDT Traces The EDT Browser Specific Functions for Hood Traces The Hood Browser Conclusions Acknowledgments References Functional Vs Object-Oriented Distributed Languages Introduction Distributed Concepts and Languages Distributed Concepts Languages Broadcast Ping Programming Style Performance Discussion Chat Room Programming Style Discussion Multi-user Shared Map Programming Style Performance Discussion Related Work Summary References Persistent Haskell Introduction Design The Haskell POS Interface Accessing Values Dynamic Typing Implementation The St Andrews POS Basic Values Preserving Sharing Reflecting Updates to the POS Functions and Partial Applications Cost Analysis Related Work Binary I/O Persistent Functional Languages Conclusions References Author Index

This book constitutes the thoroughly refereed post-proceedings of the 8th International Workshop on Computer Aided Systems Theory, EUROCAST 2001, held in Las Palmas de Gran Canaria, Spain in February 2001.
The 48 revised full papers presented together with two invited papers were carefully selected during two rounds of reviewing and revision. The book offers topical sections on computer aided systems theory, mathematical and logical formalisms, information and decision, complexity, neural-like computation, automation and control, computer algebra and automated theorem proving, and functional programming and lambda calculus.

This book constitutes the thoroughly refereed post-proceedings of the 8th International Workshop on Computer Aided Systems Theory, EUROCAST 2001, held in Las Palmas de Gran Canaria, Spain in February 2001. The 48 revised full papers presented together with two invited papers were carefully selected during two rounds of reviewing and revision. The book offers topical sections on computer aided systems theory, mathematical and logical formalisms, information and decision, complexity, neural-like computation, automation and control, computer algebra and automated theorem proving, and functional programming and lambda calculus