Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Benjamin Bisping"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
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.
Externí odkaz:
https://doaj.org/article/78e66f72c27e4a4cbe1e59272dc68ec1
Autor:
Benjamin Bisping, Luisa Montanari
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 339:27-42
We present the first game characterization of contrasimilarity, the weakest form of bisimilarity. The game is finite for finite-state processes and can thus be used for contrasimulation equivalence checking, of which no tool has been capable to date.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f15433c4bcafbe6d658d82e3a1ac1377
https://doi.org/10.4204/eptcs.339.5
https://doi.org/10.4204/eptcs.339.5
Autor:
Benjamin Bisping, Uwe Nestmann
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030720155
TACAS (1)
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030720155
TACAS (1)
We introduce a generalization of the bisimulation game that can be employed to find all relevant distinguishing Hennessy–Milner logic formulas for two compared finite-state processes. By measuring the use of expressive powers, we adapt the formula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::576cf142415fafe9ac1654d03a76c97b
http://europepmc.org/articles/PMC7979226
http://europepmc.org/articles/PMC7979226
Coupled similarity is an equivalence on (labeled) transition systems; its distinguishing power lies between (weak) bisimilarity and (may) testing equivalence. Its main feature, compared to weak bisimilarity, is an additional $$\tau $$-law that abstra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c50ffddeee80b5b62152e8980ee5e94e
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/96279
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/96279
Autor:
Uwe Nestmann, Benjamin Bisping
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030174613
TACAS (1)
TACAS (1)
Coupled similarity is a notion of equivalence for systems with internal actions. It has outstanding applications in contexts where internal choices must transparently be distributed in time or space, for example, in process calculi encodings or in ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d70a9ff0ea408bd5770d13722f97c759
https://doi.org/10.1007/978-3-030-17462-0_14
https://doi.org/10.1007/978-3-030-17462-0_14
Autor:
Arno Wilhelm-Weidner, Kirstin Peters, Uwe Nestmann, Christina Rickmann, Anke Stüber, Tim Jungnickel, Henning Seidler, Benjamin Bisping, Paul-David Brodmann
Publikováno v:
Interactive Theorem Proving ISBN: 9783319431437
ITP
ITP
The impossibility of distributed consensus with one faulty process is a result with important consequences for real world distributed systems e.g., commits in replicated databases. Since proofs are not immune to faults and even plausible proofs with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0483046db36a4c5766f77d009c5e6846
https://doi.org/10.1007/978-3-319-43144-4_7
https://doi.org/10.1007/978-3-319-43144-4_7