skip to content
Automatic Verification Methods for Finite State Systems : International Workshop, Grenoble, France. June 12-14, 1989. Proceedings Preview this item
ClosePreview this item
Checking...

Automatic Verification Methods for Finite State Systems : International Workshop, Grenoble, France. June 12-14, 1989. Proceedings

Author: J Sifakis
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1990.
Series: Lecture notes in computer science, 407.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Publication:Springer e-books.
Summary:
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 for automatic verification of finite state systems. The goal at the workshop was to compare verification methods and  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Congrès
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: J Sifakis
ISBN: 9783540521488 3540521488
OCLC Number: 793077060
Description: 1 online resource : v.: digital.
Contents: 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.
Series Title: Lecture notes in computer science, 407.
Responsibility: by Joseph Sifakis.

Abstract:

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 for automatic verification of finite state systems. The goal at the workshop was to compare verification methods and tools to assist the applications designer. The papers in this volume review verification techniques for finite state systems and evaluate their relative advantages. The techniques considered cover various specification formalisms such as process algebras, automata and logics. Most of the papers focus on exploitation of existing results in three application areas: hardware design, communication protocols and real-time systems.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/793077060> # Automatic Verification Methods for Finite State Systems : International Workshop, Grenoble, France. June 12-14, 1989. Proceedings
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
   library:oclcnum "793077060" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1065555429#Place/berlin_heidelberg> ; # Berlin, Heidelberg
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   schema:about <http://id.worldcat.org/fast/1124185> ; # Software engineering
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:about <http://id.worldcat.org/fast/1002045> ; # Logic design
   schema:about <http://dewey.info/class/005.1015113/e23/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/1065555429#Topic/protocoles_de_reseaux_d_ordinateurs> ; # Protocoles de réseaux d'ordinateurs
   schema:bookFormat schema:EBook ;
   schema:creator <http://viaf.org/viaf/110770950> ; # Joseph Sifakis
   schema:datePublished "1990" ;
   schema:description "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."@en ;
   schema:description "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 for automatic verification of finite state systems. The goal at the workshop was to compare verification methods and tools to assist the applications designer. The papers in this volume review verification techniques for finite state systems and evaluate their relative advantages. The techniques considered cover various specification formalisms such as process algebras, automata and logics. Most of the papers focus on exploitation of existing results in three application areas: hardware design, communication protocols and real-time systems."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/1065555429> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
   schema:name "Automatic Verification Methods for Finite State Systems : International Workshop, Grenoble, France. June 12-14, 1989. Proceedings"@en ;
   schema:productID "793077060" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/793077060#PublicationEvent/berlin_heidelberg_springer_berlin_heidelberg_1990> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/1065555429#Agent/springer_berlin_heidelberg> ; # Springer Berlin Heidelberg
   schema:url <http://dx.doi.org/10.1007/3-540-52148-8> ;
   schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-52148-8> ;
   schema:url <http://link.springer.com/10.1007/3-540-52148-8> ;
   schema:workExample <http://worldcat.org/isbn/9783540521488> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/793077060> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1065555429#Agent/springer_berlin_heidelberg> # Springer Berlin Heidelberg
    a bgn:Agent ;
   schema:name "Springer Berlin Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/1065555429#Place/berlin_heidelberg> # Berlin, Heidelberg
    a schema:Place ;
   schema:name "Berlin, Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/1065555429#Topic/protocoles_de_reseaux_d_ordinateurs> # Protocoles de réseaux d'ordinateurs
    a schema:Intangible ;
   schema:name "Protocoles de réseaux d'ordinateurs"@fr ;
    .

<http://id.worldcat.org/fast/1002045> # Logic design
    a schema:Intangible ;
   schema:name "Logic design"@en ;
    .

<http://id.worldcat.org/fast/1124185> # Software engineering
    a schema:Intangible ;
   schema:name "Software engineering"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
   schema:name "Computer science"@en ;
    .

<http://viaf.org/viaf/110770950> # Joseph Sifakis
    a schema:Person ;
   schema:birthDate "1946" ;
   schema:familyName "Sifakis" ;
   schema:givenName "Joseph" ;
   schema:givenName "J." ;
   schema:name "Joseph Sifakis" ;
    .

<http://worldcat.org/isbn/9783540521488>
    a schema:ProductModel ;
   schema:isbn "3540521488" ;
   schema:isbn "9783540521488" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/793077060> ; # Automatic Verification Methods for Finite State Systems : International Workshop, Grenoble, France. June 12-14, 1989. Proceedings
   schema:issn "0302-9743" ;
   schema:name "Lecture notes in computer science ;" ;
   schema:name "Lecture Notes in Computer Science," ;
    .

<http://www.worldcat.org/title/-/oclc/793077060>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/793077060> ; # Automatic Verification Methods for Finite State Systems : International Workshop, Grenoble, France. June 12-14, 1989. Proceedings
   schema:dateModified "2018-11-09" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.