Automatic verification methods for finite state systems : international workshop, Grenoble, France, June 12-14, 1989 : proceedings
This volume contains the proceedings of a workshop held in Grenoble in June 1989. This was the first workshop entirely devoted to the verification of finite state systems. The workshop brought together researchers and practitioners interested in the development and use of methods, tools and theories...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
407 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automatic verification methods for finite state systems, international workshop, Grenoble, France, June 12-14, 1989, proceedings, J. Sifakis (Ed.), Berlin, Springer-Verlag, 1990, 1 vol. (VII-382 p.), Lecture notes in computer science, 0-387-52148-8 • Automatic Verification Methods for Finite State Systems, Texte imprimé, 9783662179789 |
Sisällysluettelo:
- Process calculi, from theory to practice: Verification tools
- Testing equivalence as a bisimulation equivalence
- The concurrency workbench
- Argonaute: Graphical description, semantics and verification of reactive systems by using a process algebra
- Using the axiomatic presentation of behavioural equivalences for manipulating CCS specifications
- Verifying properties of large sets of processes with network invariants
- A method for verification of trace and test equivalence
- Projections of the reachability graph and environment models
- Proving properties of elementary net systems with a special-purpose theorem prover
- Verification by abstraction and bisimulation
- MEC : a system for constructing and analysing transition systems
- Fair SMG and linear time model checking
- Network grammars, communication behaviors and automatic verification
- CCS, liveness, and local model checking in the linear time mu-calculus
- Implementing a model checking algorithm by adapting existing automated tools
- On-line model-checking for finite linear temporal logic specifications
- Timing assumptions and verification of finite-state concurrent systems
- Specifying, programming and verifying real-time systems using a synchronous declarative language
- Modal specifications
- Automated verification of timed transition models
- Temporal logic case study
- The complexity of collapsing reachability graphs
- What are the limits of model checking methods for the verification of real life protocols?
- Requirement analysis for communication protocols
- State exploration by transformation with lola
- Parallel protocol verification: The two-phase algorithm and complexity analysis
- Formal verification of synchronous circuits based on string-functional semantics: The 7 paillet circuits in boyer-moore
- Combining CTL, trace theory and timing models
- Localized verification of circuit descriptions
- Verification of synchronous sequential machines based on symbolic execution
- Parallel composition of lockstep synchronous processes for hardware validation: Divide-and-conquer composition.