A theory for simulator tools:
Abstract: "This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ([mu])CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,2 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ([mu])CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the explored process terms. This is done by considering two processes, say p and q, equivalent if each simulation of p is also a simulation of q and vice versa. It is proven that there is no 'reasonable' simulator inducing bisimulation equivalence. Furthermore it is demonstrated that simulators inducing coarser equivalences, e.g. ready, failure and trace equivalences, are unlikely to be computationally tractable Our conclusion is that a practical simulator induces an equivalence that is finer (less identifying) than bisimulation and even finer than graph isomorphism. |
| Beschreibung: | 21 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009033864 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31237751 | ||
| 035 | |a (DE-599)BVBBV009033864 | ||
| 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 A theory for simulator tools |c Henri Korver |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 21 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 93,2 | |
| 520 | 3 | |a Abstract: "This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ([mu])CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the explored process terms. This is done by considering two processes, say p and q, equivalent if each simulation of p is also a simulation of q and vice versa. It is proven that there is no 'reasonable' simulator inducing bisimulation equivalence. Furthermore it is demonstrated that simulators inducing coarser equivalences, e.g. ready, failure and trace equivalences, are unlikely to be computationally tractable | |
| 520 | 3 | |a Our conclusion is that a practical simulator induces an equivalence that is finer (less identifying) than bisimulation and even finer than graph isomorphism. | |
| 650 | 4 | |a Computer simulation | |
| 650 | 4 | |a Semantics | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,2 |w (DE-604)BV008928356 |9 93,2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005976652 | ||
Datensatz im Suchindex
| _version_ | 1804123387358871552 |
|---|---|
| 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 | BV009033864 |
| ctrlnum | (OCoLC)31237751 (DE-599)BVBBV009033864 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01841nam a2200313 cb4500</leader><controlfield tag="001">BV009033864</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31237751</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009033864</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">A theory for simulator tools</subfield><subfield code="c">Henri Korver</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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">93,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ([mu])CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the explored process terms. This is done by considering two processes, say p and q, equivalent if each simulation of p is also a simulation of q and vice versa. It is proven that there is no 'reasonable' simulator inducing bisimulation equivalence. Furthermore it is demonstrated that simulators inducing coarser equivalences, e.g. ready, failure and trace equivalences, are unlikely to be computationally tractable</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Our conclusion is that a practical simulator induces an equivalence that is finer (less identifying) than bisimulation and even finer than graph isomorphism.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</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">93,2</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005976652</subfield></datafield></record></collection> |
| id | DE-604.BV009033864 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005976652 |
| oclc_num | 31237751 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 21 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Korver, Henri P. Verfasser aut A theory for simulator tools Henri Korver Amsterdam 1993 21 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,2 Abstract: "This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ([mu])CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the explored process terms. This is done by considering two processes, say p and q, equivalent if each simulation of p is also a simulation of q and vice versa. It is proven that there is no 'reasonable' simulator inducing bisimulation equivalence. Furthermore it is demonstrated that simulators inducing coarser equivalences, e.g. ready, failure and trace equivalences, are unlikely to be computationally tractable Our conclusion is that a practical simulator induces an equivalence that is finer (less identifying) than bisimulation and even finer than graph isomorphism. Computer simulation Semantics Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,2 (DE-604)BV008928356 93,2 |
| spellingShingle | Korver, Henri P. A theory for simulator tools Computer simulation Semantics |
| title | A theory for simulator tools |
| title_auth | A theory for simulator tools |
| title_exact_search | A theory for simulator tools |
| title_full | A theory for simulator tools Henri Korver |
| title_fullStr | A theory for simulator tools Henri Korver |
| title_full_unstemmed | A theory for simulator tools Henri Korver |
| title_short | A theory for simulator tools |
| title_sort | a theory for simulator tools |
| topic | Computer simulation Semantics |
| topic_facet | Computer simulation Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT korverhenrip atheoryforsimulatortools |