@inproceedings{
    HelSte:ACSD05,
    editor = {Desel, J{\"o}rg and Watanabe, Yosinori},
    author = "Heljanko, Keijo and Stefanescu, Alin",
    ignoreurl = "http://dx.doi.org/10.1109/ACSD.2005.7",
    publisher = "{IEEE} Computer Society",
    issn = "1550-4808",
    isbn = "0-7695-2363-3",
    title = "Complexity Results for Checking Distributed Implementability",
    url = "http://users.ics.tkk.fi/kepa/publications/",
    series = "",
    booktitle = "Proceedings of the 5th International Conference on Application of Concurrency to System Design (ACSD'2005)",
    address = "St Malo, France",
    corerank = "B",
    abstract = "We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution $\Delta$ of its actions over a set of processes, does there exist a distributed system over $\Delta$ such that its global transitions system is `equivalent' to TS? We consider the distributed systems modeled as synchronous products of transitions systems [Arn94], respectively as asynchronous automata [Zie87]. In this paper we provide complexity bounds for the above problem with three interpretations for `equivalent': as transition system isomorphism, language equivalence, and bisimilarity. In particular, we solve problems left open in [Mor99,CMT99].",
    month = "June",
    volume = "",
    juforank = "1",
    flags = "ACPT",
    year = "2005",
    keywords = "synthesis, distributed systems",
    pages = "78--87"
}