These are the joint ? nal proceedings of the 11th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2006) and the ? fth International Workshop on Parallel and Distributed Methods in Veri? cation (PDMC 2006). Both workshops were organized as satellite events of CONCUR 2006, the 17th International Conference on Concurrency Theory that was or- nized in Bonn, August 2006. The FMICS workshop continued successfully the aim of the FMICS working group – to promote the use of formal methods for industrial applications, by supporting research in this area and its application in industry. The emphasis in these workshops is on the exchange of ideas between researchers and prac- tioners, in both industry and academia. This year the Program Committee received a record number of submissions. The 16 accepted regular contributions and 2 accepted tool papers, selected out of a total of 47 submissions, cover formal methodologies for handling large state spaces, model-based testing, formal description and analysis techniques as well as a range of applications and case studies. The workshop program included two invited talks, by Anna Slobodova from Intel on “Challenges for Formal Veri? cation in an Industrial Setting” and by Edward A. Lee from the University of California at Berkeley on “Making C- currency Mainstream.” The former full paper can be found in this volume.
Luboš Brim Book order






- 2007
- 2002
Concurrency theory
- 611 pages
- 22 hours of reading
This book constitutes the refereed proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, held in Brno, Czech Republic in August 2002. The 32 revised full papers presented together with abstracts of seven invited contributions were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on verification and model checking, logic, mobility, probabilistic systems, models of computation and process algebra, security, Petri nets, and bisimulation.
- 1998
Mathematical foundations of computer science 1998
- 843 pages
- 30 hours of reading
This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998. The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..