Petri nets: an introduction
A calculus of mobile processes, II
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Distributed and Parallel Databases
Modern Concurrency Abstractions for C#
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
High-Level Petri Nets as Type Theories in the Join Calculus
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Jocaml: Mobile Agents for Objective-Caml
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
Comments on capabilities, limitations and “correctness” of Petri nets
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
YAWL: yet another workflow language
Information Systems
Using the π-calculus for formalizing workflow patterns
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Coordination Models Orc and Reo Compared
Electronic Notes in Theoretical Computer Science (ENTCS)
Reduction Semantics and Formal Analysis of Orc Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Event structure semantics of Orc
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
| Hi-index | 0.00 |
Cook and Misra's Orc is an elegant language for orchestrating distributed services, able to cover e.g. van der Aalst's workflow patterns. We aim to understand the key novel features of Orc by comparing it with variations of Petri nets. The comparison shows that Orc hides powerful mechanisms for name handling (creation and passing) and for atomic distributed termination. Petri nets with static topology can encode Orc under severe restrictions while the full language (up to a more realistic cancellation strategy) can be encoded in Join (that can be seen as a higher-order extension of Petri nets). As an overall result, we promote Join calculus as an elegant language embedding orchestration and computation.