Name
Abstract | ||
|---|---|---|
This paper defines a static check for clash-freedom of ASM rules, including sequential and parallel composition, nondeterministic choice, and recursion. The check computes a formula that, if provable, makes a relational encoding of ASM rules possible, which is an important prerequisite for efficient deduction. The check is general enough to cover all sequential rules as well as many typical uses of parallel composition. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-33600-8_15 | ABZ |
Keywords | DocType | Volume |
Abstract State Machines,Synchronous parallelism,Clashes | Conference | 9675 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gerhard Schellhorn | 1 | 769 | 56.43 |
| Gidon Ernst | 2 | 144 | 14.46 |
| Jörg Pfähler | 3 | 82 | 6.28 |
| Wolfgang Reif | 4 | 64 | 4.83 |