Name
Abstract | ||
|---|---|---|
Transition systems (TS) and Petri nets (PN) are important models of computation ubiquitous in formal methods for modeling systems. An important problem is how to extract from a given TS a PN whose reachability graph is equivalent (with a suitable notion of equivalence) to the original TS.This paper addresses the decomposition of transition systems into synchronizing state machines (SMs), which are... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/DSD53832.2021.00021 | 2021 24th Euromicro Conference on Digital System Design (DSD) |
Keywords | DocType | ISBN |
Visualization,Sufficient conditions,Digital systems,Instruction sets,Computational modeling,Petri nets,Computational efficiency | Conference | 978-1-6654-2703-6 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Viktor Teren | 1 | 0 | 0.34 |
| Jordi Cortadella | 2 | 1862 | 163.70 |
| Tiziano Villa | 3 | 0 | 0.34 |