Häftad, Engelska, 1974
342 kr
Skickas inom 10-15 vardagar
G. Rozenberg – författare
Visar alla böcker från författaren G. Rozenberg. Handla med fri frakt och snabb leverans.
23 produkter
23 produkter
- Häftad, Engelska, 1979
566 kr
Skickas inom 10-15 vardagar
1 124 kr
Skickas inom 10-15 vardagar
This volume presents a selection of papers presented at the 3rd European Workshop on Appl ications and Theory of Petri Nets that took place in Villa Monastero, Varenna (Italy) in the period September 27 - September 30, 1982. The I ist of topics included: nets and related models, mathematical analysis of nets, transformations and morphisms of nets, formal languages and nets, parallel program verification and nets, the pro blem of time in nets, programming languages based on nets, applications to distributed systems, applications to realtime systems, software ~~gineering, hardware design and its implementation, recoverability problems, nets and formal semantics; net tools. The diversity of topics on this list witnesses the fact that the researchers from very different areas presented their contributions and discussed various research problems during the workshop. This interaction of scientists looking at the area of Petri nets from very different points of view makes this series of workshops interesting and worthwi le. The volume documents the progress of the research concerning Petri nets during a one year time from the 2nd European Workshop held in Bad Honnef in 1981. We think that this was a substantial progress indeed. This observation is even more pleasant if one real izes that during the workshop in Varenna we have celebrated 20 years of "existence" of Petri nets (the seminal work by prof. C.A. Petri appeared precisely 20 years ago). We are very proud to present an invited address by prof. C.A. Petri in this volume.- Häftad, Engelska, 1985
532 kr
Skickas inom 10-15 vardagar
- Häftad, Engelska, 1991
566 kr
Skickas inom 10-15 vardagar
Over the last few years, object-oriented programming has been recognized as the best way currently available of structuring software systems. It emphasizes grouping together data and the operations performed on them, encapsulating the whole behind a clean interface, and organizing the resulting entities in a hierarchy based on specialization in functionality. In this way it provides excellent support for the construction of large systems. Up to now, there has been relatively little effort to develop formal theories of object-oriented programming. However, for the field to mature, a more formal understanding of the basic concepts of object-oriented programming is necessary. This volume presents the proceedings of the School/Workshop on Foundations of Object-Oriented Programming (FOOL) held in Noordwijkerhout, The Netherlands, May 28 - June 1, 1990. The workshop was an activity of the project REX (Research and Education in Concurrent Systems). - Häftad, Engelska, 1992
1 124 kr
Skickas inom 10-15 vardagar
In the past decade, the formal theory of specification,verfication and development of real-time programs has grownfrom work of a few specialized groups to a real "bandwagon".Many eminent research groups have shifted their interests inthis direction. Consequently, research in real-time is nowentering established research areas in formal methods, suchas process algebra, temporal logic, and model checking.This volume contains the proceedings of a workshop dedicatedto the theory of real-time with the purpose of stepping backand viewing the results achieved as well as considering thedirections of ongoing research. The volume gives arepresentative picture of what is going on in the fieldworldwide, presented by eminent, active researchers. Thematerial in the volume was prepared by the authors after theworkshop took place and reflects the results of the workshopdiscussions. - Häftad, Engelska, 1993
1 124 kr
Skickas inom 10-15 vardagar
Researchers working on the semantics of programminglanguages came together in The Netherlands in June 1992 fora workshop on Semantics - Foundations and Applications. Thisvolume is based on the meeting and contains materialprepared by the lecturers after the meeting took place. Thevolume includes papers on a wide range of topics in bothfoundationsand applications, including:- Comparative domain theory, category theory, informationsystems,- Concurrency: process algebras, asynchronous communication,action semantics, trace nets, process refinement, concurrentconstraint programming,- Predicate transformers, refinement,weakest preconditions,- Comparative semantics of programming concepts, fullabstraction,- Reasoning about programs: total correctness, epistemiclogic,- Logic programming,- Functional programming: sequentiality, integration withconcurrency, applied structured operational semantics.The workshop was an activity of the project REX (ResearchandEducation in Concurrent Systems) sponsored by theNetherlands NFI (NationaleFaciliteit Informatica)Programme. - Häftad, Engelska, 1994
1 124 kr
Skickas inom 10-15 vardagar
The REX School/Symposium "A Decade of Concurrency - Reflections and Perspectives" was the final event of a ten-year period of cooperation between three Dutch research groups working on the foundations of concurrency. Ever since its inception in 1983, the goal of the project has been to contribute to the cross-fertilization between formal methods from the fields of syntax, semantics, and proof theory, aimed at an improved understanding of the nature of parallel computing. The material presented in this volume was prepared by the lecturers (and their coauthors) after the meeting took place. In total, the volume constitutes a thorough state-of-the-art report of the research activities in concurrency. - Inbunden, Engelska, 1996
900 kr
Skickas inom 10-15 vardagar
This third volume of the Handbook of Formal Languages discusses language theory beyond linear or string models: trees, graphs, grids, pictures, computer graphics. Many chapters offer an authoritative self-contained exposition of an entire area. Special emphasis is on interconnections with logic. - E-bokPDF, Engelska, 2012
1 470 kr
Läs direkt efter köp
This volume presents a selection of papers presented at the 3rd European Workshop on Appl ications and Theory of Petri Nets that took place in Villa Monastero, Varenna (Italy) in the period September 27 - September 30, 1982. The I ist of topics included: nets and related models, mathematical analysis of nets, transformations and morphisms of nets, formal languages and nets, parallel program verification and nets, the pro blem of time in nets, programming languages based on nets, applications to distributed systems, applications to realtime systems, software ~~gineering, hardware design and its implementation, recoverability problems, nets and formal semantics; net tools. The diversity of topics on this list witnesses the fact that the researchers from very different areas presented their contributions and discussed various research problems during the workshop. This interaction of scientists looking at the area of Petri nets from very different points of view makes this series of workshops interesting and worthwi le. The volume documents the progress of the research concerning Petri nets during a one year time from the 2nd European Workshop held in Bad Honnef in 1981. We think that this was a substantial progress indeed. This observation is even more pleasant if one real izes that during the workshop in Varenna we have celebrated 20 years of "existence" of Petri nets (the seminal work by prof. C.A. Petri appeared precisely 20 years ago). We are very proud to present an invited address by prof. C.A. Petri in this volume. - E-bokPDF, Engelska, 2012
1 455 kr
Läs direkt efter köp
This book is dedicated to Aristid Lindenmayer on the occasion of his 60th birthday on November 17, 1985. Contributions range from mathematics and theoretical computer science to biology. Aristid Lindenmayer introduced language-theoretic models for developmental biology in 1968. Since then the models have been cus tomarily referred to as L systems. Lindenmayer''s invention turned out to be one of the most beautiful examples of interdisciplinary science: work in one area (developmental biology) induces most fruitful ideas in other areas (theory of formal languages and automata, and formal power series). As evident from the articles and references in this book, the in terest in L systems is continuously growing. For newcomers the first contact with L systems usually happens via the most basic class of L systems, namely, DOL systems. Here "0" stands for zero context between developing cells. It has been a major typographical problem that printers are unable to distinguish between 0 (zero) and 0 (oh). Thus, DOL was almost always printed with "oh" rather than "zero", and also pronounced that way. However, this misunderstanding turned out to be very fortunate. The wrong spelling "DOL" of "DOL" could be read in the suggestive way: DO L Indeed, hundreds of researchers have followed this suggestion. Some of them appear as contributors to this book. Of the many who could not contribute, we in particular regret the absence of A. Ehrenfeucht, G. Herman and H.A. Maurer whose influence in the theory of L systems has been most significant. - Häftad, Engelska, 2012
1 124 kr
Skickas inom 10-15 vardagar
This book is dedicated to Aristid Lindenmayer on the occasion of his 60th birthday on November 17, 1985. Contributions range from mathematics and theoretical computer science to biology. Aristid Lindenmayer introduced language-theoretic models for developmental biology in 1968. Since then the models have been cus tomarily referred to as L systems. Lindenmayer's invention turned out to be one of the most beautiful examples of interdisciplinary science: work in one area (developmental biology) induces most fruitful ideas in other areas (theory of formal languages and automata, and formal power series). As evident from the articles and references in this book, the in terest in L systems is continuously growing. For newcomers the first contact with L systems usually happens via the most basic class of L systems, namely, DOL systems. Here "0" stands for zero context between developing cells. It has been a major typographical problem that printers are unable to distinguish between 0 (zero) and 0 (oh). Thus, DOL was almost always printed with "oh" rather than "zero", and also pronounced that way. However, this misunderstanding turned out to be very fortunate. The wrong spelling "DOL" of "DOL" could be read in the suggestive way: DO L Indeed, hundreds of researchers have followed this suggestion. Some of them appear as contributors to this book. Of the many who could not contribute, we in particular regret the absence of A. Ehrenfeucht, G. Herman and H.A. Maurer whose influence in the theory of L systems has been most significant. - Inbunden, Engelska, 1995
2 893 kr
Skickas inom 3-6 vardagar
The theory of traces employs techniques and tackles problems from quite diverse areas which include formal language theory, combinatorics, graph theory, algebra, logic, and the theory of concurrent systems. In all these areas the theory of traces has led to interesting problems and significant results. It has made an especially big impact in formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems.This monograph covers all important research lines of the theory of traces; each chapter is devoted to one research line and is written by leading experts. The book is organized in such a way that each chapter can be read independently — and hence it is very suitable for advanced courses or seminars on formal language theory, the theory of concurrent systems, the theory of semigroups, and combinatorics. An extensive bibliography is included. At present, there is no other book of this type on trace theory. - Inbunden, Engelska, 1999
4 173 kr
Skickas inom 5-8 vardagar
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact, within the area of graph grammars, graph transformation is considered as a fundamental computation paradigm where computation includes specification, programming, and implementation. Over the last three decades, graph grammars have developed at a steady pace into a theoretically attractive and important-for-applications research field.Volume 2 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations considers applications to functional languages, visual and object-oriented languages, software engineering, mechanical engineering, chemical process engineering, and images. It also presents implemented specification languages and tools, and structuring and modularization concepts for specification languages. The contributions have been written in a tutorial/survey style by the top experts in the corresponding areas. This volume is accompanied by a CD-Rom containing implementations of specification environments based on graph transformation systems, and tools whose implementation is based on the use of graph transformation systems. - Del 40 - WORLD SCIENTIFIC SERIES IN COMPUTER SCIENCE
CURRENT TRENDS IN THEORETICAL COMPUTER SCIENCE: ESSAYS AND TUTORIALS
Inbunden, Engelska, 19932 347 kr
Tillfälligt slut
The book is a very up-to-date collection of articles in theoretical computer science, written by leading authorities in the field. The topics range from algorithms and complexity to algebraic specifications, and from formal languages and language-theoretic modeling to computational geometry. The material is based on columns and articles that have appeared in the EATCS Bulletin during the past two to three years. Although very recent research is discussed, the largely informal style of writing makes the book accessible to readers with little or no previous knowledge of the topics. - Inbunden, Engelska, 1994
2 853 kr
Tillfälligt slut
This proceedings volume provides a modern synopsis of recent studies concerning certain areas of language theory very close to applications. The topics covered range from image generation and developmental models to combinatorics of words and formal power series, as well as from fractals to computational complexity. Although the contributions represent ongoing research, much of the material is accessible to a reader with only a moderate previous knowledge of the subject. - Inbunden, Engelska, 1996
2 907 kr
Tillfälligt slut
The contributions of the proceedings cover almost all parts of the theory of formal languages from pure theoretical investigations to applications to programming languages. Main topics are combinatorial properties of words, sequences of words and sets of words, grammar systems and grammars with controlled derivations, generation of higher-dimensional objects and graphs, trace languages, numerical parameters of automata and languages. - Inbunden, Engelska, 1999
2 587 kr
Tillfälligt slut
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact, within the area of graph grammars, graph transformation is considered as a fundamental computation paradigm where computation includes specification, programming, and implementation. Over the last three decades, graph grammars have developed at a steady pace into a theoretically attractive and important-for-applications research field.Volume 3 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations presents the research on concurrency, parallelism, and distribution — important paradigms of modern computer science. The topics considered include semantics for concurrent systems, modeling of concurrency, mobile and coordinated systems, algebraic specifications, Petri nets, visual design of distributed systems, and distributed algorithms. The contributions have been written in a tutorial/survey style by the top experts. - Inbunden, Engelska, 1999
1 086 kr
Tillfälligt slut
The theory of 2-structures provides a convenient framework for decomposition and transformation of mathematical systems where one or several different binary relationships hold between the objects of the system. In particular, it forms a useful framework for decomposition and transformation of graphs.The decomposition methods presented in this book correspond closely to the top-down design methods studied in computer science. The transformation methods considered here have a natural interpretation in the dynamic evolution of certain kinds of communication networks. From the mathematical point of view, the clan decomposition method presented here, also known as modular decomposition or substitution decomposition, is closely related to the decomposition by quotients in algebra. The transformation method presented here is based on labelled 2-structures over groups, the theory of which generalizes the well-studied theory of switching classes of graphs.This book is both a text and a monograph. As a monograph, the results concerning the decomposition and transformation of 2-structures are presented in a unified way. In addition, detailed notes on references are provided at the end of each chapter. These notes allow the reader to trace the origin of many notions and results, and to browse through the literature in order to extend the material presented in the book.To facilitate its use as a textbook, there are numerous examples and exercises which provide an opportunity for the reader to check his or her understanding of the discussed material. Furthermore, the text begins with preliminaries on partial orders, semigroups, groups and graphs to the extent needed for the book. - Inbunden, Engelska, 2000
2 664 kr
Tillfälligt slut
The theory of formal languages is one of the oldest branches of theoretical computer science. Its original aim (in the fifties and sixties) was to clarify the laws and algorithms that underlie the definition and compilation of programming languages. Since then, formal language theory has changed very much. Today it includes mathematical topics like combinatorics of words, word equations, and coding theory, but it also covers connections to linguistics (for example, the study of contextual grammars), new computational paradigms (like DNA computing), and a wide range of applications, among them hypertext processing, database theory, and formal program verification. Many of these themes of modern formal language theory are represented in this volume. - Inbunden, Engelska, 2001
5 077 kr
Tillfälligt slut
The scientific developments at the end of the past millennium were dominated by the huge increase and diversity of disciplines with the common label “computer science”. The theoretical foundations of such disciplines have become known as theoretical computer science. This book highlights some key issues of theoretical computer science as they seem to us now, at the beginning of the new millennium.The text is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science in the period 1995–2000. The columnists themselves selected the material they wanted for the book, and the editors had a chance to update their work. Indeed, much of the material presented here appears in a form quite different from the original. Since the presentation of most of the articles is reader-friendly and does not presuppose much knowledge of the area, the book constitutes suitable supplementary reading material for various courses in computer science. - Inbunden, Engelska, 2004
5 915 kr
Tillfälligt slut
This book is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science (EATCS) during the period 2000–2003. It presents many of the most active current research lines in theoretical computer science. The material appears in two volumes, “Algorithms and Complexity” and “Formal Models and Semantics”, reflecting the traditional division of the field.The list of contributors includes many of the well-known researchers in theoretical computer science. Most of the articles are reader-friendly and do not presuppose much knowledge of the area in question. Therefore, the book constitutes very suitable supplementary reading material for various courses and seminars in computer science. - Inbunden, Engelska, 2004
1 878 kr
Tillfälligt slut
This book is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science (EATCS) during the period 2000–2003. It presents many of the most active current research lines in theoretical computer science. The material appears in two volumes, “Algorithms and Complexity” and “Formal Models and Semantics”, reflecting the traditional division of the field.The list of contributors includes many of the well-known researchers in theoretical computer science. Most of the articles are reader-friendly and do not presuppose much knowledge of the area in question. Therefore, the book constitutes very suitable supplementary reading material for various courses and seminars in computer science.
