Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Information and Computation
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
Comparing three semantics for Linda-like languages
Theoretical Computer Science
Functorial models for petri nets
Information and Computation
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Zero-safe nets: The individual token approach
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Persistant Linda: Linda + Transactions + Query Processing
Research Directions in High-Level Parallel Programming Languages
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Axioms for Contextual Net Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Orchestrating Transactions in Join Calculus
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Modelling Concurrent Accesses to Shared Data via Petri Nets
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Contextual Occurence Nets and Concurrent Constraint Programming
Proceedings of the International Workshop on Graph Transformations in Computer Science
Two Algebraic Process Semantics for Contextual Nets
Unifying Petri Nets, Advances in Petri Nets
Petri Nets over Partial Algebra
Unifying Petri Nets, Advances in Petri Nets
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Transactions and Zero-Safe Nets
Unifying Petri Nets, Advances in Petri Nets
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Truly Concurrent View of Linda Interprocess Communication
A Truly Concurrent View of Linda Interprocess Communication
Mobile Petri Nets
Functorial models for contextual pre-nets
Functorial models for contextual pre-nets
IBM Systems Journal
Executing transactions in zero-safe nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Synchronous Multiparty Synchronizations and Transactions
Concurrency, Graphs and Models
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
Web Services and Models of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
From theory to practice in transactional composition of web services
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Hi-index | 0.00 |
Nowadays concepts, languages and models for coordination cannot leave aside the needs of the increasing number of commercial applications based on global computing over the (inter)net. For example, platforms like Microsoft .NET and Sun Microsystems Java come equipped with packages for supporting ad hoc transactional features, which are essential for most business applications. We show how to extend the coordination language par excellence (viz. Linda) with basic primitives for transactions, while retaining a formal model for its concurrent computations. This is achieved by exploiting a variation of Petri nets, called zero-safe nets, where transactions can be suitably modelled by distinguishing between stable places (ordinary ones) and zero places (where tokens can only be temporarily allocated, defining hidden states). The relevance of the transaction mechanism is illustrated in terms of expressive power. Finally, it is shown that stable places and transactions viewed as atomic steps define an abstract semantics that is apt for a fully algebraic treatment, as demonstrated via categorical adjunctions between suitable categories of nets.