الصفحة 6
الصفحة 6
Automated deduction – CADE 28 ; 28th International Conference on automated deduction, Virtual Event, July 12–15, 2021, Proceedings
This book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions.
Automata, languages and programming ; Vol. 3580 ; 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings
This book constitutes the refereed proceedings of 32nd International Colloquium on Automata, Languages and Programming ICALP 2005, Lisbon, Portugal, July 11-15, 2005. including Topics Computer Science, general Mathematical Logic and Foundations Theory of Computation Software Engineering/Programming and Operating Systems Data Structures and Information Theory Data Structures
Applications and theory of Petri Nets 2005 ; 26th international conference, ICATPN 2005, Miami, FL, June 20-25, 2005, Proceedings
This volume contains the proceedings of the 26th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (ICATPN 2005). The Petri net conferences serve to discuss yearly progress in the ?eld of Petri nets and related models of concurrency, and to foster new - vancesintheapplicationandtheoryofPetrinets. Several tutorials and workshops were organized within the conf- ence, covering introductory and advanced aspects related to Petri nets.Detailed
Application and Theory of Petri Nets 2002 ; 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002. Proceedings
This book constitutes the refereed proceedings of the 23rd International Conference on Application and Theory of Petri Nets, ICATPN 2002, held in Adelaide, Australia, in June 2002. The 18 regular papers and one tool presentation presented together with six invited paper were carefully reviewed and selected from 45 submissions. All current issues on research and development of Petri nets are addressed, in particular concurrent systems analysis, model validation, business process management, reactive systems, workflow processes, wireless transaction protocols.
Analytical and Stochastic Modeling Techniques and Applications ; 15th International Conference, ASMTA 2008 Nicosia, Cyprus, June 4-6, 2008 Proceedings
This book constitutes the refereed proceedings of the 15th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2008, held in Nicosia, Cyprus, in June 2008.
Algebraic Methodology and Software Technology ; 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings
This is the proceedings of the 11th edition of the Algebraic Methodology and Software Technology (AMAST) conference series. The rst conference was held in the USA in 1989, and since then AMAST conferences have been held on (or near) fve diferent continents and have been hosted by many of the most prominent people and organizations in the ?eld. The AMAST initiative has always sought to have practical efects by dev- oping the science of software and basing it on a ?rm mathematical foundation. AMAST hasinterpretedsoftwaretechnologybroadly,andhas, for example, held AMAST workshops in areas as diverse as real-time systems and (natural) l- guage processing. Similarly, algebraic methodology is interpreted broadly and includes abstract algebra, category theory, logic, and a range of other ma- ematical subdisciplines.
Agent Computing and Multi-Agent Systems ; 9th Pacific Rim International Workshop on Multi-Agents, PRIMA 2006, Guilin, China, August 7-8, 2006, Proceedings
PRIMA is a series of workshops on agent computing and multi-agent systems, integrating the activities in Asia and Pacific Rim countries. Agent computing and multi-agent systems are computational systems in which several autonomous or se- autonomous agents interact with each other or work together to perform some set of tasks or satisfy some set of goals. These systems may involve computational agents that are homogeneous or heterogeneous, they may involve activities on the part of agents having common or distinct goals, and they may involve participation on the part of humans and intelligent agents. The aim of PRIMA 2006 was to bring together Asian and Pacific Rim researchers and developers from academia and industry to report on the latest technical advances or domain applications and to discuss and explore scientific and practical problems as raised by the participants. PRIMA 2006 received 203 submitted papers.
Agent and Multi-Agent Systems : Technologies and Applications ; 2nd KES International Symposium, KES-AMSTA 2008, Incheon, Korea, March 26-28, 2008. Proceedings
The KES-AMSTA Symposium Series is a sub-series of the KES Conference Series. The aim of the symposium was to provide an international forum for scientific research into the technologies and applications of agent and multi-agent systems.
Advances in web and network technologies, and information management ; APWeb/WAIM 2007 International Workshops : DBMAN 2007, WebETrends 2007, PAIS 2007 and ASWAN 2007, Huang Shan, China, June 16-18, 2007, Proceedings
With the increasing ubiquity of personal computing devices, such as mobile phones and PDAs, and the increasing deployment of sensor networks, new distributed applications are developed over networked databases posing interesting challenges. It aimed to bring together researchers in different fields related to database management and application over networks and to provide a forum where researchers and practitioners could share and exchange their knowledge and experience.
Advances in verification of time Petri Nets and timed automata : A temporal logic approach
This monograph presents a comprehensive introduction to timed automata (TA) and time Petri nets (TPNs) which belong to the most widely used models of real-time systems. Some of the existing methods of translating time Petri nets to timed automata are presented, with a focus on the translations that correspond to the semantics of time Petri nets, associating clocks with various components of the nets. "Advances in Verification of Time Petri Nets and Timed Automata – A Temporal Logic Approach" introduces timed and untimed temporal specification languages and gives model abstraction methods based on state class approaches for TPNs and on partition refinement for TA. Moreover, the monograph presents a recent progress in the development of two model checking methods, based on either exploiting abstract state spaces or on application of SAT-based symbolic techniques.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
Abstraction Refinement for Large Scale Model Checking
This book describes recent research developments in automatic abstraction refinement techniques. The authors address the main challenge in abstraction refinement, i.e., the ability to efficiently reach or come close to the optimum abstraction (the smallest abstract model that proves or refutes the given property). A suite of fully automatic abstraction techniques are proposed to improve the overall computation efficiency. The suite of algorithms presented in this book has demonstrated significant improvement over the prior art; some of them have already been adopted by the EDA companies in their commercial/in-house verification tools.
25 Years of Model Checking : History, Achievements, Perspectives
Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and hybrid systems. Model checking is extensively used in the hardware industry and has also been applied to the verification of many types of software. Model checking has been introduced into computer science and electrical engineering curricula at universities worldwide and has become a universal tool for the analysis of systems.
