2015
DOI: 10.1016/j.scico.2014.07.005
|View full text |Cite
|
Sign up to set email alerts
|

Timed Rebeca schedulability and deadlock freedom analysis using bounded floating time transition system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
3
1

Relationship

3
6

Authors

Journals

citations
Cited by 35 publications
(17 citation statements)
references
References 12 publications
0
17
0
Order By: Relevance
“…Sending messages are non-blocking and there is no explicit receive statement. In Timed Rebeca [10,11] three keywords are added to model logical time: delay, after and deadline. Time tags are attached to events and states of each actor.…”
Section: Timed Rebeca and Verification Of Cyber-physical Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…Sending messages are non-blocking and there is no explicit receive statement. In Timed Rebeca [10,11] three keywords are added to model logical time: delay, after and deadline. Time tags are attached to events and states of each actor.…”
Section: Timed Rebeca and Verification Of Cyber-physical Systemsmentioning
confidence: 99%
“…Our approach aims to formally verify time properties for safety requirements in CPS. Timed Rebeca [9][10][11] is designed for modeling and formal verification of distributed, concurrent and event-driven asynchronous systems with timing constraints. Timed Rebeca is proposed for verification of cyber-physical systems in [12] and is used for modeling and analysing different CPS examples like medical devices [13] and PLCs [14].…”
Section: Introductionmentioning
confidence: 99%
“…For instance, Real-time Maude [12], a timed rewriting logic framework and temporal model checking tool, has been applied to actors [3]. Similarly, the modeling language Rebeca performs analysis that uses a model checker to ensure that nondeterminism allowed in the model does not lead to behaviors that violate timing requirements [8]. Alternatively, constraints can be placed on actors' allowable behaviors so that they adhere to a well-defined model of computation, satisfying, by construction, desirable properties such as deadlock freedom, schedulability, bounded memory usage, and deterministic execution.…”
Section: Actorsmentioning
confidence: 99%
“…The semantics of Timed Rebeca is defined in terms of timed automata [67], timed transition systems [68], Real-time Maude [80], and floating time transition systems [68]. Floating time transition systems constitute an innovative semantics for real-time actors, resulting in a significantly reduced time and memory consumption when verifying timed actor models.…”
Section: :10mentioning
confidence: 99%