6533b7cffe1ef96bd1258360
RESEARCH PRODUCT
Process specification and verification
Klaus Barthelmannsubject
Predicate logicGraph rewritingWait-for graphTheoretical computer scienceComputer scienceProgramming languagecomputer.software_genreLanguage Of Temporal Ordering SpecificationRule-based machine translationGraph (abstract data type)Temporal logicAlgebraic numbercomputerComputer Science::Databasesdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1996-01-01 |