Universal properties verification of parameterized parallel systems

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a method for verifying universal properties of parameterized parallel systems using Parameterized Predicate Diagrams [10]. Parameterized Predicate Diagrams are diagrams which are used to represent the abstractions of such systems described by specifications written in temporal logic. This method presented here integrates deductive verification and algorithmic techniques. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking can be used to verify properties over finite-state abstractions. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Nugraheni, C. E. (2005). Universal properties verification of parameterized parallel systems. In Lecture Notes in Computer Science (Vol. 3482, pp. 453–462). Springer Verlag. https://doi.org/10.1007/11424857_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free