Next Article in Journal
Pressure Model of Control Valve Based on LS-SVM with the Fruit Fly Algorithm
Previous Article in Journal
Economic Dispatch Using Modified Bat Algorithm
Article Menu

Export Article

Open AccessArticle

Model Checking Properties on Reduced Trace Systems

Dipartimento di Ingegneria, Università del Sannio, Benevento 82100, Italy
Dipartimento di Ingegneria della Informazione, Università di Pisa, Pisa 56122, Italy
Authors to whom correspondence should be addressed.
Algorithms 2014, 7(3), 339-362;
Received: 7 February 2014 / Revised: 16 May 2014 / Accepted: 24 June 2014 / Published: 8 July 2014
PDF [273 KB, uploaded 8 July 2014]


Temporal 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
Keywords: trace systems; model checking; linear and branching time temporal logic; state explosion trace systems; model checking; linear and branching time temporal logic; state explosion
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Santone, A.; Vaglini, G. Model Checking Properties on Reduced Trace Systems. Algorithms 2014, 7, 339-362.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top