Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://dx.doi.org/10.18419/opus-2545
Langanzeige der Metadaten
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Heljanko, Keijo | de |
dc.contributor.author | Stefanescu, Alin | de |
dc.date.accessioned | 2005-04-07 | de |
dc.date.accessioned | 2016-03-31T07:58:30Z | - |
dc.date.available | 2005-04-07 | de |
dc.date.available | 2016-03-31T07:58:30Z | - |
dc.date.issued | 2004 | de |
dc.identifier.other | 117300624 | de |
dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-22272 | de |
dc.identifier.uri | http://elib.uni-stuttgart.de/handle/11682/2562 | - |
dc.identifier.uri | http://dx.doi.org/10.18419/opus-2545 | - |
dc.description.abstract | We consider the distributed implementability problem as: Given a labelled transition system TS together with a distribution D of its actions over a set of processes, does there exist a distributed system over D such that its global transition system is equivalent' to TS? We consider the distributed system models of synchronous products of transition systems and Zielonka's asynchronous automata. In this paper we provide complexity bounds for the above problem with three interpretations of equivalent': as transition system isomorphism, as language equivalence, and as bisimilarity. In particular, we solve two problems left open in the literature. We also describe a logic programming implementation which complements the existing implementation for the synthesis of asynchronous automata initiated by the second author. | en |
dc.language.iso | en | de |
dc.relation.ispartofseries | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2004,5 | de |
dc.rights | info:eu-repo/semantics/openAccess | de |
dc.subject.classification | Logische Programmierung , Nebenläufigkeit , Programmierung | de |
dc.subject.ddc | 004 | de |
dc.subject.other | synchronous products , asynchronous automata , logic programming , synthesis , computational complexity , concurrency | en |
dc.title | Complexity results for checking distributed implementability | en |
dc.type | workingPaper | de |
dc.date.updated | 2013-07-05 | de |
ubs.fakultaet | Fakultät Informatik, Elektrotechnik und Informationstechnik | de |
ubs.institut | Institut für Formale Methoden der Informatik | de |
ubs.opusid | 2227 | de |
ubs.publikation.typ | Arbeitspapier | de |
ubs.schriftenreihe.name | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik | de |
Enthalten in den Sammlungen: | 05 Fakultät Informatik, Elektrotechnik und Informationstechnik |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
TR_2004_05.pdf | 324,92 kB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.