Model Checking Properties on Reduced Trace Systems
AbstractTemporal logic has become a well-established method for specifying the behavior of distributed systems. In this paper, we interpret a temporal logic over a partial order model that is a trace system. The satisfaction of the formulae is directly defined on traces on the basis of rewriting rules; so, the graph representation of the system can be completely avoided; moreover, a method is presented that keeps the trace system finite, also in the presence of infinite computations. To further reduce the complexity of model checking temporal logic formulae, an abstraction technique is applied to trace systems. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Santone, A.; Vaglini, G. Model Checking Properties on Reduced Trace Systems. Algorithms 2014, 7, 339-362.
Santone A, Vaglini G. Model Checking Properties on Reduced Trace Systems. Algorithms. 2014; 7(3):339-362.Chicago/Turabian Style
Santone, Antonella; Vaglini, Gigliola. 2014. "Model Checking Properties on Reduced Trace Systems." Algorithms 7, no. 3: 339-362.