Skip to main content
Conference Proceedings

Process specification and verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1073 225-239
DOI: 10.1007/3-540-61228-9_90
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Graph grammars provide a very convenient specification tool for distributed systems of processes. This paper addresses the problem how properties of such specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.

Cite

CITATION STYLE

APA

Barthelmann, K. (1996). Process specification and verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 225–239). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_90

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