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

verificationProceedingsWorkshopspecificationGrenoble (France)process algebrasprotocolsAutomatic verification methodsfinite state concurrent systemsFinite state systemssystems of communicating processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

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