Listing 1 - 10 of 16 | << page >> |
Sort by
|
Choose an application
Micro-programmation --- Microprogrammering --- Microprogramming --- Microprocessors --- Logic circuits --- Microprogrammation --- Microprocesseurs --- Circuits logiques --- Programming --- Programmation --- Systèmes, Conception de --- Systèmes, Conception de.
Choose an application
Petri nets --- Machine theory --- Réseaux de Pétri --- Automates mathématiques, Théorie des --- Congresses --- Congrès --- Réseaux de Pétri --- Automates mathématiques, Théorie des --- Congrès --- Computer science. --- Information theory. --- Mathematics. --- Computer software. --- Logic design. --- Computation by Abstract Devices. --- Theory of Computation. --- Mathematics, general. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Processor Architectures. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Software, Computer --- Computer systems --- Math --- Science --- Communication theory --- Communication --- Cybernetics --- Informatics
Choose an application
This volume contains papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, MFCS '90, held at Banská Bystrica, Czechoslovakia, August 27-31, 1990. Previous MFCS proceedings have also been published in the Lecture Notes in Computer Science. This symposium is the 15th in a series of international meetings which have taken place in Czechoslovakia and Poland. The aim of these symposia is to bring together specialists in theoretical fields of computer science from various countries and to stimulate mathematical research in theoretical computer science. These proceedings consist of 10 invited papers and 52 communications selected by the international Program Committee. The papers present the latest results in key areas of computer science by authors from Europe, USA, Japan and China.
681.3*F1 --- Computation by abstract devices --- 681.3*F1 Computation by abstract devices --- Computer science --- Mathematics --- Congresses --- Computer science - Mathematics - Congresses. --- Computer science. --- Information theory. --- Computer software. --- Logic design. --- Computation by Abstract Devices. --- Theory of Computation. --- Mathematics of Computing. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Software, Computer --- Computer systems --- Communication theory --- Communication --- Cybernetics --- Informatics --- Science
Choose an application
Integrated circuits --- Logic design --- Very large scale integration --- Design and construction --- Mathematical models --- Logic design. --- Circtuis intégrés à très grande échelle --- Structure logique --- Mathematical models. --- Conception et construction --- Modèles mathématiques --- Design, Logic --- Design of logic systems --- Chips (Electronics) --- Circuits, Integrated --- Computer chips --- Microchips --- Very large scale integration&delete& --- Design and construction&delete& --- Structure logique. --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Electronic circuits --- Microelectronics --- Integrated circuits - Very large scale integration - Design and construction - Mathematical models
Choose an application
Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.
Formal languages --- Formele talen --- Languages [Formal ] --- Langues formalisées --- Machines sequentielles [Theorie des ] --- Sequential machine theory --- Sequentiele machinetheorie --- Talen [Formele ] --- 681.3*F --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Formalization (Linguistics) --- Language and languages --- Theory of computation --- 681.3*F Theory of computation --- Sequential machine theory. --- Formal languages. --- Information theory. --- Computer science. --- Logic design. --- Theory of Computation. --- Discrete Mathematics. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics
Choose an application
The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association Française de Cybernétique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft für Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.
Computer science --- Informatique --- Congresses --- Congrès --- -681.3*F --- 681.3*G2 --- 681.3*I1 --- 681.3*I35 --- Informatics --- Science --- Theory of computation --- Discrete mathematics (Mathematics of computing) --- Algebraic manipulation (Computing methodologies) --- Computational geometry and object modeling (Computer graphics) --- 681.3*I1 Algebraic manipulation (Computing methodologies) --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 681.3*F Theory of computation --- 681.3*I35 Computational geometry and object modeling (Computer graphics) --- Congrès --- 681.3*F --- Information theory. --- Computer science. --- Computer software. --- Logic design. --- Theory of Computation. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Software, Computer --- Computer systems --- Communication theory --- Communication --- Cybernetics
Choose an application
The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.
Electronic data processing --- Traitement réparti --- Distributed processing --- Congresses --- Congrès --- -681.3*D13 --- 681.3*F3 --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Concurrent programming --- Logics and meanings of programs (Theory of computation) --- Automation --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D13 Concurrent programming --- Traitement réparti --- Congrès --- 681.3*D13 --- Distributed processing&delete& --- Computer network architectures. --- Logic design. --- Computer science. --- Computer Communication Networks. --- Computer System Implementation. --- Logics and Meanings of Programs. --- Programming Techniques. --- Informatics --- Science --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture
Choose an application
This volume gives the proceedings of the conference CONCUR '90. This is the first conference organized by ESPRIT Basic Research Action 3006, CONCUR (Theories of Concurrency: Unification and Extension), started in September 1989. The principal aims of the action are to explore the relationships among the different approaches to algebraic concurrency theory, and to develop a formalism applicable to a wide range of case studies. The articles in this volume describe the state of the art in concurrency, the theory of communicating concurrent (or distributed) systems.
Machine theory --- Parallel processing (Electronic computers) --- Automates mathématiques, Théorie des --- Parallélisme (Informatique) --- Congresses --- Congrès --- -Parallel processing (Electronic computers) --- -681.3*D13 --- 681.3*D3 --- 681.3*F12 --- 681.3*F3 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Concurrent programming --- Programming languages --- Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- Logics and meanings of programs (Theory of computation) --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*F12 Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- 681.3*D3 Programming languages --- 681.3*D13 Concurrent programming --- Automates mathématiques, Théorie des --- Parallélisme (Informatique) --- Congrès --- Machine theory - Congresses. --- Parallel processing (Electronic computers) - Congresses. --- Computer science. --- Information theory. --- Mathematics. --- Logic design. --- Computation by Abstract Devices. --- Theory of Computation. --- Mathematics, general. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Math --- Science --- Communication theory --- Communication --- Cybernetics --- Informatics --- -Congresses --- Concurrency
Choose an application
This book deals with the presentation and systematic design of mathematical proofs, including correctness proofs of algorithms. Its purpose is to show how completeness of argument, an important constraint especially for the correctness of algorithms, can be combined with brevity. The author stresses that the use of formalism is indispensible for achieving this. A second purpose of the book is to discuss matters of design. Rather than addressing psychological questions, the author deals with more technical questions like how analysis of the shape of the demonstrandum can guide the design of a proof. This technical rather than psychological view of heuristics together with the stress on exploiting formalism effectively are two key features of the book. The book consists of two independently readable parts. One part includes a number of general chapters discussing techniques for clear exposition, the use of formalism, the choice of notations, the choice of what to name and how to name it, and so on. The other part consists of a series of expositional essays, each dealing with a proof or an algorithm and illustrating the use of techniques discussed in the more general chapters.
Bewijstheorie --- Preuve [Theorie de la ] --- Proof theory --- Proof theory. --- Théorie de la preuve --- 681.3*D24 --- 681.3*F31 --- Logic, Symbolic and mathematical --- Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D24 Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Théorie de la preuve --- Software engineering. --- Logic. --- Logic design. --- Software Engineering/Programming and Operating Systems. --- Logics and Meanings of Programs. --- Software Engineering. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Argumentation --- Deduction (Logic) --- Deductive logic --- Dialectic (Logic) --- Logic, Deductive --- Intellect --- Philosophy --- Psychology --- Science --- Reasoning --- Thought and thinking --- Computer software engineering --- Engineering --- Methodology
Choose an application
This volume contains the revised versions of 28 papers presented at the third workshop on Computer Science Logic held in Kaiserslautern, FRG, October 2-6, 1989. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science, e.g. in complexity, data base theory, logic programming, artificial intelligece, and temporal logic. The volume should be of interest to all logicians and computer scientists working in the above field.
Computer science --- Logic, Symbolic and mathematical --- Informatique --- Logique symbolique et mathématique --- Mathematics --- Congresses --- Mathématiques --- Congrès --- 681.3*H2 --- -Logic, Symbolic and mathematical --- -681.3*D3 --- 681.3*I2 --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Database management: security; integrity; protection--See also {?681.5*E5} --- -Congresses --- Programming languages --- Artificial intelligence. AI --- 681.3*I2 Artificial intelligence. AI --- 681.3*D3 Programming languages --- 681.3*H2 Database management: security; integrity; protection--See also {?681.5*E5} --- Logique symbolique et mathématique --- Mathématiques --- Congrès --- 681.3*D3 --- Mathematics&delete& --- Logic [Symbolic and mathematical ] --- Computer science - Mathematics - Congresses. --- Logic, Symbolic and mathematical - Congresses. --- Artificial intelligence. --- Software engineering. --- Logic design. --- Computer science. --- Artificial Intelligence. --- Software Engineering/Programming and Operating Systems. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Computer software engineering --- Engineering --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers
Listing 1 - 10 of 16 | << page >> |
Sort by
|