Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy
We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state processes. We identify the relevant dimensions that mea...
Uloženo v:
| Vydáno v: | Logical methods in computer science Ročník 18, Issue 3 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Logical Methods in Computer Science e.V
09.08.2022
|
| Témata: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We introduce a generalization of the bisimulation game that finds
distinguishing Hennessy-Milner logic formulas from every finitary,
subformula-closed language in van Glabbeek's linear-time--branching-time
spectrum between two finite-state processes. We identify the relevant
dimensions that measure expressive power to yield formulas belonging to the
coarsest distinguishing behavioral preorders and equivalences; the compared
processes are equivalent in each coarser behavioral equivalence from the
spectrum. We prove that the induced algorithm can determine the best fit of
(in)equivalences for a pair of processes. |
|---|---|
| AbstractList | We introduce a generalization of the bisimulation game that finds
distinguishing Hennessy-Milner logic formulas from every finitary,
subformula-closed language in van Glabbeek's linear-time--branching-time
spectrum between two finite-state processes. We identify the relevant
dimensions that measure expressive power to yield formulas belonging to the
coarsest distinguishing behavioral preorders and equivalences; the compared
processes are equivalent in each coarser behavioral equivalence from the
spectrum. We prove that the induced algorithm can determine the best fit of
(in)equivalences for a pair of processes. We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state processes. We identify the relevant dimensions that measure expressive power to yield formulas belonging to the coarsest distinguishing behavioral preorders and equivalences; the compared processes are equivalent in each coarser behavioral equivalence from the spectrum. We prove that the induced algorithm can determine the best fit of (in)equivalences for a pair of processes. |
| Author | Bisping, Benjamin Jansen, David N. Nestmann, Uwe |
| Author_xml | – sequence: 1 givenname: Benjamin orcidid: 0000-0002-0637-0171 surname: Bisping fullname: Bisping, Benjamin – sequence: 2 givenname: David N. orcidid: 0000-0002-6636-3301 surname: Jansen fullname: Jansen, David N. – sequence: 3 givenname: Uwe surname: Nestmann fullname: Nestmann, Uwe |
| BookMark | eNpNkE1PAjEQhhuDiYj8AU896qG6ne52W26AqCQkHMRz0-3OQsl-YBdJ-PcuYIxzmfedw5PMc0t6dVMjIfc8eoolaPVcVq5lXD2IEdePEAFckT5XMmKJTuPev3xDhm27jboRgiuQfWJf0Pnc12s6Lks6wY09-CbYks6-vv3Bllg7bKnd02UXRnRM32yFtGgCXfgabWArXyFjk2Brt-kw504_duj2oWldszvekevCli0Of_eAfL7OVtN3tli-zafjBXMAAlicgMYsAp0IlcW2yJK4iHLhOAqBqLI0srETCsFxpbMkF8hVzmXBE5BgQYsBmV-4eWO3Zhd8ZcPRNNab86EJa2PD3rsSTapQyiIFBynGHTZDjomGFHInFTreseDCct0TbcDij8cjc3ZuTs4NV0YYrs3JufgBbD92jw |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/lmcs-18(3:19)2022 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_78e66f72c27e4a4cbe1e59272dc68ec1 10_46298_lmcs_18_3_19_2022 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c2232-4529eb029538b4afb54f0d3c1e33ee8b70a4c38e2c189b5d3e18d16f15262a293 |
| IEDL.DBID | DOA |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:38:40 EDT 2025 Sat Nov 29 06:21:52 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2232-4529eb029538b4afb54f0d3c1e33ee8b70a4c38e2c189b5d3e18d16f15262a293 |
| ORCID | 0000-0002-0637-0171 0000-0002-6636-3301 |
| OpenAccessLink | https://doaj.org/article/78e66f72c27e4a4cbe1e59272dc68ec1 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_78e66f72c27e4a4cbe1e59272dc68ec1 crossref_primary_10_46298_lmcs_18_3_19_2022 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-08-09 |
| PublicationDateYYYYMMDD | 2022-08-09 |
| PublicationDate_xml | – month: 08 year: 2022 text: 2022-08-09 day: 09 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2022 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.3116076 |
| Snippet | We introduce a generalization of the bisimulation game that finds
distinguishing Hennessy-Milner logic formulas from every finitary,
subformula-closed language... We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - computer science and game theory computer science - formal languages and automata theory computer science - logic in computer science f.2.2 f.4.1 |
| Title | Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy |
| URI | https://doaj.org/article/78e66f72c27e4a4cbe1e59272dc68ec1 |
| Volume | 18, Issue 3 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV05T8MwFLYQYmDhRpRLHhhAyKK2c9jdWiiwcAwgdbNs50Wq1IMjILHw23l20qpMLCyRE0WO9b0Xf372Owg5KUXb5UnpmESFYdhQTKUuZVaWXibOFapUsdhEfn-vBgP9uFDqK_iE1emBa-AucgVZVubCixwSm3gHHFItclH4TIGPhg-uehaMqTgHh0-LrI6SSTKh1cVo7N8ZV6eyw_UZmvziFxMtJOyPzHK9QdaaJSHt1kPZJEsw2SLrs3ILtPn7tom9Aj8MVEO7oxHtzePraf_1Y4gKEz2iqa3oAzY6tEtv7BgoLkopGpyo0CyEezDWC6U0wr5TvKehAH0VUlpOX752yPN1_-nyljUVEphHWhcsnJqCawuN05ZLbOnSpGwX0nOQEkC5vI2ISQXCc6VdWkjgquBZiaSdCYtMv0uWJ9MJ7BEqpBfKWo4d-yRLtZVI9Iqnvggnj8Bb5HyGlnmpE2EYNCAitiZga7gy0nBtArYt0guAzt8MSazjAxStaURr_hLt_n90ckBWw4Ciz54-JMvV2wcckRX_WQ3f346j1uD17rv_A0S2x54 |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Deciding+All+Behavioral+Equivalences+at+Once%3A+A+Game+for+Linear-Time--Branching-Time+Spectroscopy&rft.jtitle=Logical+methods+in+computer+science&rft.au=Bisping%2C+Benjamin&rft.au=Jansen%2C+David+N.&rft.au=Nestmann%2C+Uwe&rft.date=2022-08-09&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=18%2C+Issue+3&rft_id=info:doi/10.46298%2Flmcs-18%283%3A19%292022&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_18_3_19_2022 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |