Complexity Results for Checking Distributed Implementability

Authors:
Keijo Heljanko;Alin Stefanescu
Affiliations:
Helsinki University of Technology;University of Stuttgart
Venue:
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Year:
2005

Citing 0
Cited 3

Achieving compositionality of the stable model semantics for smodels programs1

Theory and Practice of Logic Programming
Safe distribution of declarative processes

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Declarative modelling and safe distribution of healthcare workflows

FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the distributed implementability problem: Given a labeled transition system TS together with a distribution ? of its actions over a set of processes, does there exist a distributed system over ? such that its global transition system is ýequivalentý to TS? We work with the distributed system models of synchronous products of transition systems [1] and asynchronous automata [18]. 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 problems left open in [4, 10].