Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Information flow vs. resource access in the asynchronous pi-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model-Based Performance Prediction in Software Development: A Survey
IEEE Transactions on Software Engineering
A Theory of Distributed Objects
A Theory of Distributed Objects
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Verification approach of metropolis design framework for embedded systems
International Journal of Parallel Programming
Coverage breach problems in bandwidth-constrained sensor networks
ACM Transactions on Sensor Networks (TOSN)
Task automata: Schedulability, decidability and undecidability
Information and Computation
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Bandwidth-constrained queries in sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
Programming Erlang: Software for a Concurrent World
Programming Erlang: Software for a Concurrent World
Scala Actors: Unifying thread-based and event-based programming
Theoretical Computer Science
Theoretical Computer Science
Implementing and analyzing in Maude the Enhanced Interior Gateway Routing Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
A Verification System for Distributed Objects with Asynchronous Method Calls
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A complete guide to the future
ESOP'07 Proceedings of the 16th European conference on Programming
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
JCoBox: generalizing active objects to concurrent components
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Dynamic resource reallocation between deployment components
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Validating timed models of deployment components with parametric concurrency
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Formal semantics of a VDM extension for distributed embedded systems
Concurrency, Compositionality, and Correctness
Hi-index | 0.00 |
Many software systems today are designed for deployment on a range of architectures. However, in formal models it is typically assumed that the architecture is known and fixed; for example, that the software is sequential or concurrent, that the communication environment is synchronous or asynchronous but ordered, etc. In order to specify and analyze models which range over different deployment scenarios, it is interesting to lift aspects of low-level deployment variability to the abstraction level of the modeling language. In this paper, we propose a technique for introducing explicit resource constraints on concurrent objects in a timed extension of Creol, a formally defined high-level object-oriented modeling language. The technique is demonstrated by examples concerning rate restrictions on communication between objects. These restrictions are compositional and non-invasive: no change to the functional parts of the model is required, and restrictions can be selectively applied to parts of the model. In fact, the rate restrictions are captured by parameters in the model, which allows timed simulations to be performed with varying rate restrictions. We demonstrate the usefulness of explicit rate restrictions on communication in the model by a case study of wireless sensor networks. In this domain, rate restrictions may be understood as an abstraction over the collision patterns of broadcast data packets. Simulation results with different rate restrictions show how the timed throughput of data to the sink node in the network varies depending on the available rates.