Selected papers of the Second Workshop on Concurrency and compositionality
Unique decomposition of processes
Theoretical Computer Science
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Handbook of logic in computer science (vol. 4)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Communication and Concurrency
Decompositions of Asynchronous Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Verification of Parallel Systems via Decomposition
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Trace Consistent Subset of PTL
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
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
| Hi-index | 0.00 |
We study the problem of synthesizing distributed implementations from global specifications. In particular, we characterize when a global transition system can be implemented as a synchronized product of local transition systems. Our work extends a number of previous studies in this area which have tended to make strong assumptions about the specification--either in terms of determinacy or in terms of information concerning concurrency. We also examine the more difficult problem where the correctness of the implementation in relation to the specification is stated in terms of bisimulation rather than isomorphism. As an important first step, we show how the synthesis problem can be solved in this setting when the implementation is required to be deterministic.