Inproceedings2122466167: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tobias |ErsterAutorNachname=Blechmann |FurtherAuthors=Christel Baier}} {{Inproceedings |Booktitle=Proc. of the 4th International Workshop on Formal Aspects of Component Software (FACS) |Pages=209--226 |Publisher=Elsevier |Series=Electronic Notes in Theoretical Computer Science |Title=Checking Equivalence for Reo Networks |Volume=215 |Year=2008 }} {{Publikation Details |DOI Name=10.1016/J.ENTCS.2…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 15: | Zeile 15: | ||
|DOI Name=10.1016/J.ENTCS.2008.06.029 | |DOI Name=10.1016/J.ENTCS.2008.06.029 | ||
|Abstract=Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper addresses the problem of checking equivalence of two Reo networks. We present a compositional approach for the generation of a symbolic representation of constraint automata for Reo networks and report on an implementation that realizes a partitioning splitter technique for checking bisimulation equivalence for Reo networks. Using a special operator on our symbolic data structure enables efficient treatment of the rich labeled transitions in constraint automata. In order to show the power of this approach we then present some benchmarks. | |Abstract=Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper addresses the problem of checking equivalence of two Reo networks. We present a compositional approach for the generation of a symbolic representation of constraint automata for Reo networks and report on an implementation that realizes a partitioning splitter technique for checking bisimulation equivalence for Reo networks. Using a special operator on our symbolic data structure enables efficient treatment of the rich labeled transitions in constraint automata. In order to show the power of this approach we then present some benchmarks. | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 14:43 Uhr
Checking Equivalence for Reo Networks
Tobias BlechmannTobias Blechmann, Christel BaierChristel Baier
Tobias Blechmann, Christel Baier
Checking Equivalence for Reo Networks
Proc. of the 4th International Workshop on Formal Aspects of Component Software (FACS), volume 215 of Electronic Notes in Theoretical Computer Science, 209--226, 2008. Elsevier
Checking Equivalence for Reo Networks
Proc. of the 4th International Workshop on Formal Aspects of Component Software (FACS), volume 215 of Electronic Notes in Theoretical Computer Science, 209--226, 2008. Elsevier
- KurzfassungAbstract
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper addresses the problem of checking equivalence of two Reo networks. We present a compositional approach for the generation of a symbolic representation of constraint automata for Reo networks and report on an implementation that realizes a partitioning splitter technique for checking bisimulation equivalence for Reo networks. Using a special operator on our symbolic data structure enables efficient treatment of the rich labeled transitions in constraint automata. In order to show the power of this approach we then present some benchmarks. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{BB2008,
author = {Tobias Blechmann and Christel Baier},
title = {Checking Equivalence for Reo Networks},
booktitle = {Proc. of the 4th International Workshop on Formal Aspects of
Component Software (FACS)},
series = {Electronic Notes in Theoretical Computer Science},
volume = {215},
publisher = {Elsevier},
year = {2008},
pages = {209--226},
doi = {10.1016/J.ENTCS.2008.06.029}
}
