Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings

zbMath0745.68017MaRDI QIDQ1188590

No author found.

Publication date: 17 September 1992

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

verification; Proceedings; Workshop; specification; Grenoble (France); process algebras; protocols; Automatic verification methods; finite state concurrent systems; Finite state systems; systems of communicating processes

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68-06: Proceedings, conferences, collections, etc. pertaining to computer science

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Model-Checking View-Based Partial Specifications, EXPTIME-complete Decision Problems for Modal and Mixed Specifications, Safe reasoning with logic LTS, Conjunction on processes: Full abstraction via ready-tree semantics, Compositional verification of sequential programs with procedures, On model checking multiple hybrid views, A partition refinement algorithm for the \(\pi\)-calculus, Module checking, A linear-time branching-time perspective on interface automata, A linear-time-branching-time spectrum for behavioral specification theories, Logical vs. behavioural specifications, A generalised theory of interface automata, component compatibility and error, Error-pruning in interface automata, Interface automata for shared memory