Verification and synthesis of concurrent programs using Petri nets and temporal logic:
Abstract: "Both Petri net and temporal logic have been widely used to specify concurrent systems. Petri net is appropriate to explicitly specify the behavioral structures of systems, while temporal logic is appropriate to specify the properties and constraints of systems. Since one can compleme...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum
900 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Both Petri net and temporal logic have been widely used to specify concurrent systems. Petri net is appropriate to explicitly specify the behavioral structures of systems, while temporal logic is appropriate to specify the properties and constraints of systems. Since one can complement the other, using a combination of Petri net and temporal logic is a highly promising approach to analyze, verify and synthesize concurrent programs Several reports on research efforts have been presented to combine a non-restricted Petri net with propositional temporal logic. However, the Petri net combined with temporal logic in these reports is so powerful that it is inappropriate for use in automatic verification and synthesis, because of its undecidability. This paper reports a class that is formulated as an infinite language and whose satisfiability problem is decidable. We then show how to verify concurrent programs using Petri nets and temporal logic, and also propose a compositional synthesis method that can tune up a row program (reused program) to satisfy a temporal logic specification. |
| Beschreibung: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010972481 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960926s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24863322 | ||
| 035 | |a (DE-599)BVBBV010972481 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Uchihira, Naoshi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Verification and synthesis of concurrent programs using Petri nets and temporal logic |c by N. Uchihira & S. Honiden |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |v 900 | |
| 520 | 3 | |a Abstract: "Both Petri net and temporal logic have been widely used to specify concurrent systems. Petri net is appropriate to explicitly specify the behavioral structures of systems, while temporal logic is appropriate to specify the properties and constraints of systems. Since one can complement the other, using a combination of Petri net and temporal logic is a highly promising approach to analyze, verify and synthesize concurrent programs | |
| 520 | 3 | |a Several reports on research efforts have been presented to combine a non-restricted Petri net with propositional temporal logic. However, the Petri net combined with temporal logic in these reports is so powerful that it is inappropriate for use in automatic verification and synthesis, because of its undecidability. This paper reports a class that is formulated as an infinite language and whose satisfiability problem is decidable. We then show how to verify concurrent programs using Petri nets and temporal logic, and also propose a compositional synthesis method that can tune up a row program (reused program) to satisfy a temporal logic specification. | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Petri nets | |
| 700 | 1 | |a Honiden, Shinichi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |v 900 |w (DE-604)BV010943497 |9 900 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007341899 | ||
Datensatz im Suchindex
| _version_ | 1804125460621164544 |
|---|---|
| any_adam_object | |
| author | Uchihira, Naoshi Honiden, Shinichi |
| author_facet | Uchihira, Naoshi Honiden, Shinichi |
| author_role | aut aut |
| author_sort | Uchihira, Naoshi |
| author_variant | n u nu s h sh |
| building | Verbundindex |
| bvnumber | BV010972481 |
| ctrlnum | (OCoLC)24863322 (DE-599)BVBBV010972481 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02189nam a2200325 cb4500</leader><controlfield tag="001">BV010972481</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960926s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24863322</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010972481</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Uchihira, Naoshi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Verification and synthesis of concurrent programs using Petri nets and temporal logic</subfield><subfield code="c">by N. Uchihira & S. Honiden</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum</subfield><subfield code="v">900</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Both Petri net and temporal logic have been widely used to specify concurrent systems. Petri net is appropriate to explicitly specify the behavioral structures of systems, while temporal logic is appropriate to specify the properties and constraints of systems. Since one can complement the other, using a combination of Petri net and temporal logic is a highly promising approach to analyze, verify and synthesize concurrent programs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Several reports on research efforts have been presented to combine a non-restricted Petri net with propositional temporal logic. However, the Petri net combined with temporal logic in these reports is so powerful that it is inappropriate for use in automatic verification and synthesis, because of its undecidability. This paper reports a class that is formulated as an infinite language and whose satisfiability problem is decidable. We then show how to verify concurrent programs using Petri nets and temporal logic, and also propose a compositional synthesis method that can tune up a row program (reused program) to satisfy a temporal logic specification.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Petri nets</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Honiden, Shinichi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum</subfield><subfield code="v">900</subfield><subfield code="w">(DE-604)BV010943497</subfield><subfield code="9">900</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007341899</subfield></datafield></record></collection> |
| id | DE-604.BV010972481 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:55Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007341899 |
| oclc_num | 24863322 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 8 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| spelling | Uchihira, Naoshi Verfasser aut Verification and synthesis of concurrent programs using Petri nets and temporal logic by N. Uchihira & S. Honiden Tokyo, Japan 1990 8 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 900 Abstract: "Both Petri net and temporal logic have been widely used to specify concurrent systems. Petri net is appropriate to explicitly specify the behavioral structures of systems, while temporal logic is appropriate to specify the properties and constraints of systems. Since one can complement the other, using a combination of Petri net and temporal logic is a highly promising approach to analyze, verify and synthesize concurrent programs Several reports on research efforts have been presented to combine a non-restricted Petri net with propositional temporal logic. However, the Petri net combined with temporal logic in these reports is so powerful that it is inappropriate for use in automatic verification and synthesis, because of its undecidability. This paper reports a class that is formulated as an infinite language and whose satisfiability problem is decidable. We then show how to verify concurrent programs using Petri nets and temporal logic, and also propose a compositional synthesis method that can tune up a row program (reused program) to satisfy a temporal logic specification. Logic, Symbolic and mathematical Petri nets Honiden, Shinichi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 900 (DE-604)BV010943497 900 |
| spellingShingle | Uchihira, Naoshi Honiden, Shinichi Verification and synthesis of concurrent programs using Petri nets and temporal logic Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum Logic, Symbolic and mathematical Petri nets |
| title | Verification and synthesis of concurrent programs using Petri nets and temporal logic |
| title_auth | Verification and synthesis of concurrent programs using Petri nets and temporal logic |
| title_exact_search | Verification and synthesis of concurrent programs using Petri nets and temporal logic |
| title_full | Verification and synthesis of concurrent programs using Petri nets and temporal logic by N. Uchihira & S. Honiden |
| title_fullStr | Verification and synthesis of concurrent programs using Petri nets and temporal logic by N. Uchihira & S. Honiden |
| title_full_unstemmed | Verification and synthesis of concurrent programs using Petri nets and temporal logic by N. Uchihira & S. Honiden |
| title_short | Verification and synthesis of concurrent programs using Petri nets and temporal logic |
| title_sort | verification and synthesis of concurrent programs using petri nets and temporal logic |
| topic | Logic, Symbolic and mathematical Petri nets |
| topic_facet | Logic, Symbolic and mathematical Petri nets |
| volume_link | (DE-604)BV010943497 |
| work_keys_str_mv | AT uchihiranaoshi verificationandsynthesisofconcurrentprogramsusingpetrinetsandtemporallogic AT honidenshinichi verificationandsynthesisofconcurrentprogramsusingpetrinetsandtemporallogic |