Amir Pnueli – författare

This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final value on termination. The family of reactive systems includes many classes of programs whose correct and reliable construction is con­ sidered to be particularly challenging, including concurrent programs, embedded and process control programs, and operating systems. Typical examples of such systems are an air traffic control system, programs controlling mechanical devices such as a train, or perpetually ongoing processes such as a nuclear reactor. With the expanding use of computers in safety-critical areas, where failure is potentially disastrous, correctness is crucial. This has led to the introduction of formal verification techniques, which give both users and designers of software and hardware systems greater confidence that the systems they build meet the desired specifications. Framework The approach promoted in this book is based on the use of temporal logic for specifying properties of reactive systems, and develops an extensive verification methodology for proving that a system meets its temporal specification. Reactive programs must be specified in terms of their ongoing behavior, and temporal logic provides an expressive and natural language for specifying this behavior. Our framework for specifying and verifying temporal properties of reactive systems is based on the following four components: 1. A computational model to describe the behavior of reactive systems. The model adopted in this book is that of a Fair Transition System (FTS).

Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems. This volume, the first of two, subtitled Specification, has a self-contained introduction to temporal logic and, more important, an introduction to the computational model for reactive programs, developed by Zohar Manna and Amir Pnueli of Stanford University and the Weizmann Institute of Science, Israel, respectively.

Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems. This volume, the first of two, subtitled Specification, has a self-contained introduction to temporal logic and, more important, an introduction to the computational model for reactive programs, developed by Zohar Manna and Amir Pnueli of Stanford University and the Weizmann Institute of Science, Israel, respectively.

This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final value on termination. The family of reactive systems includes many classes of programs whose correct and reliable construction is con­ sidered to be particularly challenging, including concurrent programs, embedded and process control programs, and operating systems. Typical examples of such systems are an air traffic control system, programs controlling mechanical devices such as a train, or perpetually ongoing processes such as a nuclear reactor. With the expanding use of computers in safety-critical areas, where failure is potentially disastrous, correctness is crucial. This has led to the introduction of formal verification techniques, which give both users and designers of software and hardware systems greater confidence that the systems they build meet the desired specifications. Framework The approach promoted in this book is based on the use of temporal logic for specifying properties of reactive systems, and develops an extensive verification methodology for proving that a system meets its temporal specification. Reactive programs must be specified in terms of their ongoing behavior, and temporal logic provides an expressive and natural language for specifying this behavior. Our framework for specifying and verifying temporal properties of reactive systems is based on the following four components: 1. A computational model to describe the behavior of reactive systems. The model adopted in this book is that of a Fair Transition System (FTS).

Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems. This volume, the first of two, subtitled Specification, has a self-contained introduction to temporal logic and, more important, an introduction to the computational model for reactive programs, developed by Zohar Manna and Amir Pnueli of Stanford University and the Weizmann Institute of Science, Israel, respectively.

This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final value on termination. The family of reactive systems includes many classes of programs whose correct and reliable construction is con­ sidered to be particularly challenging, including concurrent programs, embedded and process control programs, and operating systems. Typical examples of such systems are an air traffic control system, programs controlling mechanical devices such as a train, or perpetually ongoing processes such as a nuclear reactor. With the expanding use of computers in safety-critical areas, where failure is potentially disastrous, correctness is crucial. This has led to the introduction of formal verification techniques, which give both users and designers of software and hardware systems greater confidence that the systems they build meet the desired specifications. Framework The approach promoted in this book is based on the use of temporal logic for specifying properties of reactive systems, and develops an extensive verification methodology for proving that a system meets its temporal specification. Reactive programs must be specified in terms of their ongoing behavior, and temporal logic provides an expressive and natural language for specifying this behavior. Our framework for specifying and verifying temporal properties of reactive systems is based on the following four components: 1. A computational model to describe the behavior of reactive systems. The model adopted in this book is that of a Fair Transition System (FTS).

This volume contains the proceedings of the Sixth Workshop on Hybrid Systems: Computation and Control (HSCC 2003), which was held in Prague, during April 3–5, 2003. The Hybrid Systems workshops attract researchers interested in the modeling, analysis, control, and implementation of systems which involve the interaction of both discrete and continuous state dynamics. The newest results and latest developments in hybrid system models, formal methods for analysis and control, computational tools, as well as new applications and examples are presented at these annual meetings. The Sixth Workshop continued the series of workshops held in Grenoble, France (HART’97), Berkeley, California, USA (HSCC’98), Nijmegen, The Neth- lands (HSCC’99), Pittsburgh, Pennsylvania, USA (HSCC 2000), Rome, Italy (HSCC 2001), and Stanford, California, USA (HSCC 2002). Proceedings of these workshops have been published by Springer-Verlag in the Lecture Notes in C- puter Science (LNCS) series. This year we assembled a technical program committee with a broad expertise in formal methods in computer science, control theory, applied mathematics, and arti?cial intelligence. We received a set of 75 high-quality submitted papers. After detailed review and discussion of these papers by the program committee, 36 papers were accepted for presentation at the workshop, and the ?nal versions of these papers appear in this volume.

This volume contains the proceedings of the Sixth Workshop on Hybrid Systems: Computation and Control (HSCC 2003), which was held in Prague, during April 3–5, 2003. The Hybrid Systems workshops attract researchers interested in the modeling, analysis, control, and implementation of systems which involve the interaction of both discrete and continuous state dynamics. The newest results and latest developments in hybrid system models, formal methods for analysis and control, computational tools, as well as new applications and examples are presented at these annual meetings. The Sixth Workshop continued the series of workshops held in Grenoble, France (HART’97), Berkeley, California, USA (HSCC’98), Nijmegen, The Neth- lands (HSCC’99), Pittsburgh, Pennsylvania, USA (HSCC 2000), Rome, Italy (HSCC 2001), and Stanford, California, USA (HSCC 2002). Proceedings of these workshops have been published by Springer-Verlag in the Lecture Notes in C- puter Science (LNCS) series. This year we assembled a technical program committee with a broad expertise in formal methods in computer science, control theory, applied mathematics, and arti?cial intelligence. We received a set of 75 high-quality submitted papers. After detailed review and discussion of these papers by the program committee, 36 papers were accepted for presentation at the workshop, and the ?nal versions of these papers appear in this volume.

This book originates from the International Symposium on Compositionality, COMPOS''97, held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full version reflect the current state of the art in the area of compositional reasoning about concurrency. The book is a valuable reference for researchers and professionals interested in formal systems design and analysis; it also is well suited for self study and use in advanced courses.

This book originates from the International Symposium on Compositionality, COMPOS'97, held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full version reflect the current state of the art in the area of compositional reasoning about concurrency. The book is a valuable reference for researchers and professionals interested in formal systems design and analysis; it also is well suited for self study and use in advanced courses.

This volume contains the ?nal proceedings of the 7th International Andrei Ershov Memorial Conference on Perspectives of System Informatics Akad- gorodok (Novosibirsk, Russia), June 15–19, 2009. PSI is a forum for academic and industrial researchers, developers and users working on topics relating to computer, software and information sciences. The conference serves to bridge the gaps between di?erent communities whose - searchareasarecoveredbybutnotlimitedtofoundationsofprogramandsystem development and analysis, programming methodology and softwareengineering, and information technologies. PSI 2009 was dedicated to the memory of a prominent scientist, academician Andrei Ershov (1931–1988),and to a signi?cant date in the history of computer science in the country, namely, the 50th anniversary of the Programming - partment founded by Andrei Ershov. Initially, the department was a part of the Institute of Mathematics and later, in 1964, it joined the newly established Computing Center of the Siberian Branch of the USSR Academy of Sciences. Andrei Ershov, who was responsible for forming the department, gathered a team of young graduates from leading Soviet universities. The ?rst signi?cant project of the department was aimed at the development of ALPHA system, an optimizing compiler for an extension of Algol 60 implemented on a Soviet c- puterM-20. Later,theresearchersofthedepartmentcreatedtheAlgibr,Epsilon, Sigma, and Alpha-6 programming systems for the BESM-6 computers. The list of their achievements also includes the ?rst Soviet time-sharing system AIST-0, the multi-language system BETA, research projects in arti?cial intelligence and parallel programming, integrated tools for text processing and publishing, and many others.

This volume contains the ?nal proceedings of the 7th International Andrei Ershov Memorial Conference on Perspectives of System Informatics Akad- gorodok (Novosibirsk, Russia), June 15–19, 2009. PSI is a forum for academic and industrial researchers, developers and users working on topics relating to computer, software and information sciences. The conference serves to bridge the gaps between di?erent communities whose - searchareasarecoveredbybutnotlimitedtofoundationsofprogramandsystem development and analysis, programming methodology and softwareengineering, and information technologies. PSI 2009 was dedicated to the memory of a prominent scientist, academician Andrei Ershov (1931–1988),and to a signi?cant date in the history of computer science in the country, namely, the 50th anniversary of the Programming - partment founded by Andrei Ershov. Initially, the department was a part of the Institute of Mathematics and later, in 1964, it joined the newly established Computing Center of the Siberian Branch of the USSR Academy of Sciences. Andrei Ershov, who was responsible for forming the department, gathered a team of young graduates from leading Soviet universities. The ?rst signi?cant project of the department was aimed at the development of ALPHA system, an optimizing compiler for an extension of Algol 60 implemented on a Soviet c- puterM-20. Later,theresearchersofthedepartmentcreatedtheAlgibr,Epsilon, Sigma, and Alpha-6 programming systems for the BESM-6 computers. The list of their achievements also includes the ?rst Soviet time-sharing system AIST-0, the multi-language system BETA, research projects in arti?cial intelligence and parallel programming, integrated tools for text processing and publishing, and many others.