Lightweight Time Modeling in Timed Creol

@inproceedings{Bjrk2010LightweightTM,
  title={Lightweight Time Modeling in Timed Creol},
  author={Joakim Bj{\o}rk and Einar Broch Johnsen and Olaf Owe and Rudolf Schlatte},
  booktitle={RTRTS},
  year={2010}
}
Creol is an object-oriented modeling language in which inherently concurrent objects exchange asynchronous method calls. The operational semantics of Creol is written in an actor-based style, formulated in rewriting logic. The operational semantics yields a language interpreter in the Maude system, which can be used to analyze models. Recently, Creol has been applied to the modeling of systems with radio communication, such as sensor systems. With radio communication, messages expire and, if… 

Figures and Tables from this paper

Models of Rate Restricted Communication for Concurrent Objects

Modelling and simulation of asynchronous real-time systems using Timed Rebeca

A tool for automated translation from Timed Rebeca to the Erlang language, which provides a first implementation of Timed rebeca, and provides the formal semantics of the language using Structural Operational Semantics, and shows its expressiveness by means of examples.

Validating Timed Models of Deployment Components with Parametric Concurrency

An abstract model of deployment components for concurrent objects is proposed, extending the Creol modeling language, and the semantics is executable on Maude, which allows simulations and test suites to be applied to a deployment component with different concurrent resources.

A Probabilistic Framework for Object-Oriented Modeling and Analysis of Distributed Systems

By probabilistic modeling of independent processor speeds, representative runs of a PCreol model are obtained using discrete-event simulation, and the model checking problem of large models becomes feasible, as well as how VeStA can be used to reason about them.

Formal Semantics and Analysis of Timed Rebeca in Real-Time Maude

A formal model-based methodology which combines the convenience of intuitive modeling in Timed Rebeca with formal verification in Real-Time Maude is provided.

Modelling and Simulation of Real-Time Systems using Timed Rebeca

An automated translation from Timed Rebeca to the Erlang language, which provides a first implementation of Timed rebeca and the formal semantics of the language using Structural Operational Semantics.

Timed Rebeca: Refinement and Simulation

An extension of the actor-based Rebeca language that can be used to model distributed and asynchronous systems with timing constraints is presented and an automated translation from Timed ReBeca to Erlang is provided.

Finite Interval-Time Transition System for Real-Time Actors

TIMed-Rebeca is extended to support modeling timed actor systems with time intervals in terms of Interval-Time Transition System (ITTS), which is developed based on the standard semantics of Timed- Rebeca.

A Formal Model of Object Mobility in Resource-Restricted Deployment Scenarios

This paper considers formal executable models of concurrent objects executing with user-defined cost models and analyzes the average behavior of models which vary in the execution capacity of deployment components and in object relocation strategies by means of Monte Carlo simulations.

The rewriting logic semantics project: A progress report

References

SHOWING 1-10 OF 21 REFERENCES

ACTORS - a model of concurrent computation in distributed systems

  • G. Agha
  • Computer Science
    MIT Press series in artificial intelligence
  • 1985
A foundational model of concurrency is developed and issues in the design of parallel systems and why the actor model is suitable for exploiting large-scale parallelism are addressed.

An Object-Oriented Component Model for Heterogeneous Nets

A simple modeling language for object-oriented components, extending the Creol language is introduced, which allows high-level modeling and formal analysis of distributed systems where interaction is managed by a variety of nets, including wireless ones.

Modular Schedulability Analysis of Concurrent Objects in Creol

An automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol is presented and an algorithm for automatically translating Creol code annotated with this real time information to timed automata is provided.

A Complete Guide to the Future

The semantics and proof system for an object-oriented language with active objects, asynchronous method calls, and futures is presented and shows that this approach to concurrency is simpler for reasoning than, say, Java's multithreaded concurrency model.

An Asynchronous Communication Model for Distributed Concurrent Objects

  • E. JohnsenOlaf Owe
  • Computer Science
    Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.
  • 2004
An object-oriented solution to distributed systems problems by means of asynchronous method calls and conditional processor release points is proposed, although at the cost of additional internal nondeterminism in the objects, this approach seems attractive in asynchronous or unreliable environments.

Dynamic Symbolic Execution for Testing Distributed Objects

This paper extends dynamic symbolic execution to distributed and concurrent systems and formalizes in rewriting logic, executes in Maude, and is applied to non-trivial examples, including an industrial case study.

Maude: specification and programming in rewriting logic

Semantics and pragmatics of Real-Time Maude

This paper describes both the semantics of Real-Time Maude specifications, and of the formal analyses supported by the tool, and explains the tool's pragmatics, both in the use of its features, and in its application to concrete examples.

Specification of real-time and hybrid systems in rewriting logic

A Foundation for Actor Computation

An actor language is presented which is an extension of a simple functional language, and an operational semantics for this extension is provided, and it is shown that the three forms of equivalence, namely, convex, must, and may equivalences, collapse to two in the presence of fairness.