Publikation: Brzozowski’s and Up-To Algorithms for Must Testing
Lade...
Dateien
Datum
2013
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
SHAN, Chung-chieh, ed.. Programming Languages and Systems : 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013, Proceedings. Cham: Springer, 2013, pp. 1-16. Lecture Notes in Computer Science. 8301. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-03541-3. Available under: doi: 10.1007/978-3-319-03542-0_1
Zusammenfassung
Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations up-to. Several notions of equivalence (or preorder) have been proposed for the analysis of concurrent systems. Usually, the problem of checking these equivalences is reduced to checking bisimilarity. In this paper, we take a different approach and propose to adapt algorithms for language equivalence to check one prime equivalence in concurrency theory, must testing semantics. To achieve this transfer of technology from language to must semantics, we take a coalgebraic outlook at the problem.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
11th Asian Symposium, APLAS 2013, 9. Dez. 2013 - 11. Dez. 2013, Melbourne, Australia
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BONCHI, Filippo, Georgiana CALTAIS, Damien POUS, Alexandra SILVA, 2013. Brzozowski’s and Up-To Algorithms for Must Testing. 11th Asian Symposium, APLAS 2013. Melbourne, Australia, 9. Dez. 2013 - 11. Dez. 2013. In: SHAN, Chung-chieh, ed.. Programming Languages and Systems : 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013, Proceedings. Cham: Springer, 2013, pp. 1-16. Lecture Notes in Computer Science. 8301. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-03541-3. Available under: doi: 10.1007/978-3-319-03542-0_1BibTex
@inproceedings{Bonchi2013Brzoz-44686,
year={2013},
doi={10.1007/978-3-319-03542-0_1},
title={Brzozowski’s and Up-To Algorithms for Must Testing},
number={8301},
isbn={978-3-319-03541-3},
issn={0302-9743},
publisher={Springer},
address={Cham},
series={Lecture Notes in Computer Science},
booktitle={Programming Languages and Systems : 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013, Proceedings},
pages={1--16},
editor={Shan, Chung-chieh},
author={Bonchi, Filippo and Caltais, Georgiana and Pous, Damien and Silva, Alexandra}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/44686">
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:creator>Caltais, Georgiana</dc:creator>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:contributor>Bonchi, Filippo</dc:contributor>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:abstract xml:lang="eng">Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations up-to. Several notions of equivalence (or preorder) have been proposed for the analysis of concurrent systems. Usually, the problem of checking these equivalences is reduced to checking bisimilarity. In this paper, we take a different approach and propose to adapt algorithms for language equivalence to check one prime equivalence in concurrency theory, must testing semantics. To achieve this transfer of technology from language to must semantics, we take a coalgebraic outlook at the problem.</dcterms:abstract>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44686"/>
<dc:contributor>Silva, Alexandra</dc:contributor>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Pous, Damien</dc:creator>
<dcterms:title>Brzozowski’s and Up-To Algorithms for Must Testing</dcterms:title>
<dc:language>eng</dc:language>
<dc:creator>Bonchi, Filippo</dc:creator>
<dcterms:issued>2013</dcterms:issued>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T12:40:33Z</dc:date>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T12:40:33Z</dcterms:available>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/44686/1/Bonchi_2-v3umrwse146x9.pdf"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:creator>Silva, Alexandra</dc:creator>
<dc:contributor>Caltais, Georgiana</dc:contributor>
<dc:contributor>Pous, Damien</dc:contributor>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/44686/1/Bonchi_2-v3umrwse146x9.pdf"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
