A collection of articles by leading experts in theoretical computer science, this volume commemorates the 75th birthday of Professor Rani Siromoney, one of the pioneers in the field in India. The articles span the vast range of areas that Professor Siromoney has worked in or influenced, including grammar systems, picture languages and new models of computation.

Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation. Covers the theory of formal languages and their models, including all essential concepts and properties Explains how language models underlie language processors Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models—regular expressions, finite automata, context-free grammars, and pushdown automata Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure Reviews the general theory of computation, particularly computability and decidability Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. After studying this book, both student and professional should be able to understand the fundamental theory of formal languages and computation, write language processors, and confidently follow most advanced books on the subject.

This book constitutes the thoroughly refereed joint postproceedings of the satellite activities held at the 7th International Conference on the Unified Modeling Language, UML 2004, in Lisbon, Portugal in October 2004 complementing the main conference track. The book presents reports on the 10 workshops held at UML and covers a broad range of topics around systems modelling; these reports are compiled by the respective workshop organizers. Furthermore 12 revised reviewed papers from the industry track are included as well as 11 short papers corresponding to selected poster/demo presentations and a summary on the UML tools exhibition.

"This book investigates a variety of programming languages used in validating and verifying models in order to assist in their eventual implementation, exploring different methods of evaluating and formalizing simulation models, enabling computer and industrial engineers, mathematicians, and students working with computer simulations to thoroughly understand the progression from simulation to product"--

Models of Computation and Formal Languages presents a comprehensive and rigorous treatment of the theory of computability. The text takes a novel approach focusing on computational models and is the first book of its kind to feature companion software. Deus Ex Machina, developed by Nicolae Savoiu, comprises software simulations of the various computational models considered and incorporates numerous examples in a user-friendly format. Part I of the text introduces several universal models including Turing machines, Markov algorithms, and register machines. Complexity theory is integrated gradually, starting in Chapter 1. The vector machine model of parallel computation is covered thoroughly both in text and software. Part II develops the Chomsky hierarchy of formal languages and provides both a grammar-theoretic and an automata-theoretic characterization of each language family. Applications to programming languages round out an in-depth theoretical discussion, making this an ideal text for students approaching this subject for the first time. Ancillary sections of several chapters relate classical computability theory to the philosophy of mind, cognitive science, and theoretical linguistics. Ideal for Theory of Computability and Theory of Algorithms courses at the advanced undergraduate or beginning graduate level, Models of Computation and Formal Languages is one of the only texts that... - - Features accompanying software available on the World Wide Web at http: //home.manhattan.edu/ gregory.taylor/thcomp/ Adopts an integrated approach to complexity theory - Offers a solutions manual containing full solutions to several hundred exercises. Most of these solutions are available to students on the World Wide Web at http: //home.manhattan.edu/ gregory.taylor/thcomp - Features examples relating the theory of computation to the probable programming experience of an undergraduate computer science major

This book constitutes the refereed proceedings of the 16th Brazilian Symposium on Formal Methods, SBMF 2013, held in Brasilia, Brazil, in September/October 2013. The 14 revised full papers presented together with 2 keynotes were carefully reviewed and selected from 29 submissions. The papers presented cover a broad range of foundational and methodological issues in formal methods for the design and analysis of software and hardware systems as well as applications in various domains.

This book constitutes the refereed proceedings of the 6th International Conference on the Unified Modelling Language, UML 2003, held in San Francisco, CA, USA in October 2003. The 25 revised full papers, 4 tool papers, and 1 experience paper presented together with the abstracts of 3 invited talks and summaries on the UML 2003 workshop and tutorials were carefully reviewed and selected from initially 168 submissions. The papers are organized in topical sections on practical model management, time and quality of service, tools, composition and architecture, transformation, Web related issues, testing and validation, improving UML/OCL, consistency, and methodology.

This book constitutes the proceedings of the 18th InternationalConference on Coordination Models and Languages, COORDINATION 2016, heldin Heraklion, Crete, Greece, in June 2016, as part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016. The 16 full papers included in this volume were carefully reviewed andselected from 44 submissions. The papers cover a wide range of topicsand techniques related to system coordination, including: programming andcommunication abstractions; communication protocols and behavioural types;actors and concurrent objects; tuple spaces; games, interfaces and contracts; information flow policies and dissemination techniques; and probabilistic modelsand formal verification.

This book constitutes the proceedings of the 10th European Conference on Modelling Foundations and Applications, ECMFA 2014, held as part of STAF 2014, in York, UK, in July 2014. The 14 foundation track papers and the 3 applications track papers presented in this volume were carefully reviewed and selected from 58 submissions. They are on all aspects of MDE, including topics such as model provenance; model transformations and code generation; model synthesis; model-driven testing; formal modeling approaches; business modeling; and usability of models.

This Festschrift volume, published in honor of Carolyn Talcott on the occasion of her 70th birthday, contains a collection of papers presented at a symposium held in Menlo Park, California, USA, in November 2011. Carolyn Talcott is a leading researcher and mentor of international renown among computer scientists. She has made key contributions to a number of areas of computer science including: semantics and verification of progamming languages; foundations of actor-based systems; middleware, meta-architectures, and systems; Maude and rewriting logic; and computational biology. The 21 papers presented are organized in topical sections named: Essays on Carolyn Talcott; actors and programming languages; cyberphysical systems; middleware and meta-architectures; formal methods and reasoning tools; and computational biology.