E-bok
Engelska, 2023995 kr
Läs direkt efter köp
Javier Esparza – författare
Visar alla böcker från författaren . Handla med fri frakt och snabb leverans.
18 produkter
18 produkter
- Del 40 - Cambridge Tracts in Theoretical Computer Science
Free Choice Petri Nets
Häftad, Engelska, 2005584 kr
Skickas inom 10-15 vardagar
Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike. - Del 379 - London Mathematical Society Lecture Note Series
Finite and Algorithmic Model Theory
Häftad, Engelska, 2011892 kr
Skickas inom 10-15 vardagar
Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research. - Del 11781 - Lecture Notes in Computer Science
Automated Technology for Verification and Analysis
17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings
Häftad, Engelska, 2019562 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis, ATVA 2019, held in Taipei, Taiwan in October 2019.The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions. The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking. - E-bokEngelska, 2019
732 kr
Läs direkt efter köp
This book constitutes the refereed proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis, ATVA 2019, held in Taipei, Taiwan in October 2019.The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions. The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking.
- Häftad, Engelska, 2002
546 kr
Skickas inom 10-15 vardagar
This volume contains the proceedings of the 23rd International Conference on Application and Theory of Petri Nets. The aim of the Petri net conferences is to createaforumfordiscussingprogressinthe applicationandtheoryofPetrinets. Typically, the conferences have 100-150participants - one third of these coming from industry while the rest are from universities and research institutions. The conferences always take place in the last week of June. The conference and a number of other activities are co-ordinated by a ste- ing committee with the following members: G. Balbo (Italy), J. Billington (A- tralia),G.De Michelis(Italy),S.Haddad(France),K.Jensen(Denmark),S.- magai (Japan), T. Murata (USA), C.A. Petri (Germany; honorary member), W. Reisig (Germany), G. Rozenberg (The Netherlands; chairman), and M. Silva (Spain). Other activities before and during the 2002 conference included tool dem- strations, extensive introductory tutorials, two advanced tutorials on "Work?ow Management: Models, Methods, and Systems" and "Model Checking", and two workshops on "Software Engineering and Formal Methods" and "Formal Me- ods Applied to Defence Systems".The tutorial notes and workshop proceedings are not published in this volume, but copies are available from the organ- ers. The proceedings can be found at http://www.jrpit.flinders.edu.au/ CRPIT.html. The 2002 conference was organized by the Computer Systems Engineering Centre, School of Electrical and Information Engineering at the University of South Australia, Adelaide, Australia with assistance from the Department of Computer Science, Adelaide University, Adelaide, Australia. We would like to thankthemembersoftheorganizingcommittee(seenextpage)andtheir teams. - E-bokPDF, Engelska, 2003
712 kr
Läs direkt efter köp
- Inbunden, Engelska, 2008
1 117 kr
Skickas inom 10-15 vardagar
Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components. In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader to tools and case studies.The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory. - E-bokPDF, Engelska, 2008
1 459 kr
Läs direkt efter köp
Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components.
In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader to tools and case studies.
The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.
- Häftad, Engelska, 2010
1 117 kr
Skickas inom 10-15 vardagar
Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components. In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader to tools and case studies.The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory. 562 kr
Skickas inom 10-15 vardagar
ETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryandPracticeofSoftware. ETAPSisanannualfederatedconferencethatwas establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual?vesisterconferences(CC,ESOP,FASE,FOSSACS, TACAS), 19 satellite workshops (ACCAT, ARSPA-WITS, Bytecode, CMCS, COCV, DCC, DICE, FBTC, FESCA, FOSS-AMA, GaLoP, GT-VMT, LDTA, MBT, PLACES, QAPL, SafeCert, WGT, and WRLA) and seven invited l- tures (excluding those that were speci?c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers), 130 of which were accepted (10 tool demos), giving an overall acc- tance rateof 26%, with most of the conferencesat around24%. Congratulations thereforetoalltheauthorswhomadeittothe?nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. The events that comprise ETAPS address various aspects of the system - velopmentprocess,including speci?cation,design, implementation, analysisand improvement.The languages, methodologies and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented,withaninclinationtowardtheorywithapracticalmotivationonthe one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardwaresystems, and the emphasis on software is not intended to be exclusive. ETAPS is a confederation in which each event retains its own identity, with a separate Programme Committee and proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by.- Häftad, Engelska, 2014
562 kr
Skickas inom 10-15 vardagar
This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation. - E-bokPDF, Engelska, 2014
712 kr
Läs direkt efter köp
This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation. - Häftad, Engelska, 2014
562 kr
Skickas inom 10-15 vardagar
This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation. - E-bokPDF, Engelska, 2014
710 kr
Läs direkt efter köp
This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation. 562 kr
Skickas inom 10-15 vardagar
This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.734 kr
Läs direkt efter köp
This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.
