2010
DOI: 10.1007/978-3-642-11623-0_12
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Abstract. We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the schedulability of objects modeled as Timed Automata. In this paper, we extend this framework to support enabling conditions for methods and replies to messages and we extend the Creol language to allow the specification of real time information. We provide an algorithm for automatically translating Creol code annotated with th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 13 publications
(21 reference statements)
0
2
0
Order By: Relevance
“…Creol is a concurrent object-oriented language with an operational semantics written in an actor-based style, and supported by a language interpreter in the Maude system. In [5], Creol is extended by adding best-case and worst-case execution time for each statement, and a deadline for each method call. In addition, an object is assigned a scheduling strategy to resolve the nondeterminism in selecting from the enabled processes.…”
Section: Related Workmentioning
confidence: 99%
“…Creol is a concurrent object-oriented language with an operational semantics written in an actor-based style, and supported by a language interpreter in the Maude system. In [5], Creol is extended by adding best-case and worst-case execution time for each statement, and a deadline for each method call. In addition, an object is assigned a scheduling strategy to resolve the nondeterminism in selecting from the enabled processes.…”
Section: Related Workmentioning
confidence: 99%
“…We discussed a possible encoding from Creol to timed automata in a past paper [4], however this encoding was incomplete, both in the Creol features covered and because it discussed only translation of one method; it would generate many automata to encode each method. In the full, efficient encoding presented in this paper, we improve scalability by reducing the number of generated automata (i.e., release statements do not generate a new automaton now).…”
Section: Related Workmentioning
confidence: 99%