The current state of bisimulation tools: H. P. Korver
Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of forma...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,8 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of formal verification methods of software descriptions. At the moment bisimulation is one of the most popular criteria for guaranteeing correctness of concurrent system descriptions. In this approach, concurrent systems are modeled as transition graphs, and verification amounts to establishing that the graph representing the implementation of the system is bisimilar to the graph representing the specification of the system The main advantage of this approach is that bisimulation can be decided efficiently and fully automatically on finite transition graphs. This paper contains a comparative evaluation of bisimulation techniques, as found in the following tools. ACP Bisimulation Tool, Branching Bisimulation Tool, Aldebaran, The Concurrency Workbench (CWB), Tool for Automatic Verification (TAV), Winston, Auto, Autograph and Ecrins. Further, the usability of these tools for PSF [MV89,MV90] is investigated. PSF is here proposed as a suitable representative of a wide range of formalisms that have come up for specifying concurrent systems. |
| Beschreibung: | 28 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224819 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27318119 | ||
| 035 | |a (DE-599)BVBBV009224819 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Korver, Henri P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The current state of bisimulation tools |b H. P. Korver |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 91,8 | |
| 520 | 3 | |a Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of formal verification methods of software descriptions. At the moment bisimulation is one of the most popular criteria for guaranteeing correctness of concurrent system descriptions. In this approach, concurrent systems are modeled as transition graphs, and verification amounts to establishing that the graph representing the implementation of the system is bisimilar to the graph representing the specification of the system | |
| 520 | 3 | |a The main advantage of this approach is that bisimulation can be decided efficiently and fully automatically on finite transition graphs. This paper contains a comparative evaluation of bisimulation techniques, as found in the following tools. ACP Bisimulation Tool, Branching Bisimulation Tool, Aldebaran, The Concurrency Workbench (CWB), Tool for Automatic Verification (TAV), Winston, Auto, Autograph and Ecrins. Further, the usability of these tools for PSF [MV89,MV90] is investigated. PSF is here proposed as a suitable representative of a wide range of formalisms that have come up for specifying concurrent systems. | |
| 650 | 4 | |a Computer networks | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,8 |w (DE-604)BV008928356 |9 91,8 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006133974 | ||
Datensatz im Suchindex
| _version_ | 1804123667898040320 |
|---|---|
| any_adam_object | |
| author | Korver, Henri P. |
| author_facet | Korver, Henri P. |
| author_role | aut |
| author_sort | Korver, Henri P. |
| author_variant | h p k hp hpk |
| building | Verbundindex |
| bvnumber | BV009224819 |
| ctrlnum | (OCoLC)27318119 (DE-599)BVBBV009224819 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02296nam a2200301 cb4500</leader><controlfield tag="001">BV009224819</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27318119</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224819</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Korver, Henri P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The current state of bisimulation tools</subfield><subfield code="b">H. P. Korver</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">91,8</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of formal verification methods of software descriptions. At the moment bisimulation is one of the most popular criteria for guaranteeing correctness of concurrent system descriptions. In this approach, concurrent systems are modeled as transition graphs, and verification amounts to establishing that the graph representing the implementation of the system is bisimilar to the graph representing the specification of the system</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The main advantage of this approach is that bisimulation can be decided efficiently and fully automatically on finite transition graphs. This paper contains a comparative evaluation of bisimulation techniques, as found in the following tools. ACP Bisimulation Tool, Branching Bisimulation Tool, Aldebaran, The Concurrency Workbench (CWB), Tool for Automatic Verification (TAV), Winston, Auto, Autograph and Ecrins. Further, the usability of these tools for PSF [MV89,MV90] is investigated. PSF is here proposed as a suitable representative of a wide range of formalisms that have come up for specifying concurrent systems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">91,8</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,8</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133974</subfield></datafield></record></collection> |
| id | DE-604.BV009224819 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133974 |
| oclc_num | 27318119 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 28 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Korver, Henri P. Verfasser aut The current state of bisimulation tools H. P. Korver Amsterdam 1991 28 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,8 Abstract: "It is a well-known fact that descriptions of concurrent systems often appear to be incorrect, in the sense that the behavior of the system does not correspond to the behavior the specifier had in mind. To overcome this problem a lot of research has been going on in the field of formal verification methods of software descriptions. At the moment bisimulation is one of the most popular criteria for guaranteeing correctness of concurrent system descriptions. In this approach, concurrent systems are modeled as transition graphs, and verification amounts to establishing that the graph representing the implementation of the system is bisimilar to the graph representing the specification of the system The main advantage of this approach is that bisimulation can be decided efficiently and fully automatically on finite transition graphs. This paper contains a comparative evaluation of bisimulation techniques, as found in the following tools. ACP Bisimulation Tool, Branching Bisimulation Tool, Aldebaran, The Concurrency Workbench (CWB), Tool for Automatic Verification (TAV), Winston, Auto, Autograph and Ecrins. Further, the usability of these tools for PSF [MV89,MV90] is investigated. PSF is here proposed as a suitable representative of a wide range of formalisms that have come up for specifying concurrent systems. Computer networks Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,8 (DE-604)BV008928356 91,8 |
| spellingShingle | Korver, Henri P. The current state of bisimulation tools H. P. Korver Computer networks |
| title | The current state of bisimulation tools H. P. Korver |
| title_auth | The current state of bisimulation tools H. P. Korver |
| title_exact_search | The current state of bisimulation tools H. P. Korver |
| title_full | The current state of bisimulation tools H. P. Korver |
| title_fullStr | The current state of bisimulation tools H. P. Korver |
| title_full_unstemmed | The current state of bisimulation tools H. P. Korver |
| title_short | The current state of bisimulation tools |
| title_sort | the current state of bisimulation tools h p korver |
| title_sub | H. P. Korver |
| topic | Computer networks |
| topic_facet | Computer networks |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT korverhenrip thecurrentstateofbisimulationtoolshpkorver |