Name
Abstract | ||
|---|---|---|
This paper describes several approaches to the formal verification of discrete event systems modeled with the DEVS formalism. We define the operational semantics of the DEVS formalism in terms of a timed transition system, then we characterize a subclass of DEVS models, through the definition of a formalism inspired by DEVS and timed automata, that allows the use of modelchecking tools. Finally, we discuss the application of this tools and present a simple example. |
Year | Venue | Keywords |
|---|---|---|
2007 | SCSC | discrete event system,formal verification approach,modelchecking tool,operational semantics,transition system,simple example,devs formalism,formal verification,devs model,devs |
Field | DocType | ISBN |
Transition system,Operational semantics,SP-DEVS,Computer science,Automaton,Real-time computing,DEVS,Formalism (philosophy),Formal verification | Conference | 1-56555-316-0 |
Citations | PageRank | References |
5 | 0.48 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hernán P. Dacharry | 1 | 6 | 0.86 |
| Norbert Giambiasi | 2 | 227 | 37.59 |