Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Why interaction is more powerful than algorithms
Communications of the ACM
On the expressive power of a language for programming coordination media
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
Well-structured transition systems everywhere!
Theoretical Computer Science
Analysis issues in Petri nets with inhibitor arcs
Theoretical Computer Science
Coordination for Internet Application Development
Autonomous Agents and Multi-Agent Systems
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Liveness and Acceleration in Parameterized Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A key feature for infrastructures providing coordination services is the ability to define the behaviour of coordination abstractions according to the requirements identified at design-time. We take as a representative for this scenario the logic-based language ReSpecT (Reaction Specification Tuples), used to program the reactive behaviour of tuple centres. ReSpecT specifications are at the core of the engineering methodology underlying the TuCSoN infrastructure, and are therefore the ''conceptual place'' where formal methods can be fruitfully applied to guarantee relevant system properties. In this paper we introduce ReSpecTnets, a formalism that can be used to describe reactive behaviours that can succeed and fail, and that allows for an encoding to Petri nets with inhibitor arcs. ReSpecT nets are introduced to give a core model to a fragment of the ReSpecT language, and to pave the way for devising an analysis methodology including formal verification of safety and liveness properties. In particular, we provide a semantics to ReSpecT specifications through a mapping to ReSpecT nets. The potential of this approach for the analysis of ReSpecT specifications is discussed, presenting initial results for the analysis of safety properties.