Categories and computer science
Categories and computer science
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Reusable coordinator modules for massively concurrent applications
Software—Practice & Experience
Span(Graph): A Categorial Algebra of Transition Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
A transition system semantics for the control-driven coordination language MANIFOLD
A transition system semantics for the control-driven coordination language MANIFOLD
Coordination of massively concurrent activities
Coordination of massively concurrent activities
Secure Publishing of XML Documents
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Calculating Colimits Compositionally
Concurrency, Graphs and Models
An Algebra of Automata That Includes Both Classical and Quantum Entities
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The authors introduce case-place automata as an abstract formal framework for the 'idealized workers and idealized managers' (IWIM) model on which the language MANIFOLD is based. Case-place automata are equipped withleft/right interfaces and in/out conditions, that are used to compose automata according to three main operations, namely restricted product, free product, and restricted sum. These operations find natural interpretations in terms of parallel composition of communicating workers and reconfigurations of modules. Taking the 'distributed sort' algorithm of [4] as a case study, it is shown that the manager process can be expressed as a recursive equation in the algebra of automata.