Results 1 
4 of
4
ModelChecking Of Infinite Graphs Defined By Graph Grammars
 In Proc. 1st International workshop on verification of infinite states systems, volume 6 of ENTCS
, 1996
"... : We propose here an algorithm that decides whether a state of an infinite graph defined by a graph grammar satisfies a given formula of the alternationfree calculus. We first show how graph grammars enable to finitely represent infinite transition systems. In particular, a connection is made betw ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
(Show Context)
: We propose here an algorithm that decides whether a state of an infinite graph defined by a graph grammar satisfies a given formula of the alternationfree calculus. We first show how graph grammars enable to finitely represent infinite transition systems. In particular, a connection is made between a state of the graph grammar and the states of the infinite graph it represents. We then present succinctly the syntax and the standard semantics of the calculus. A nonstandard semantics, called assertionbased semantics is then proposed. That semantics makes possible to reduce the study of the semantics of an infinite graph to parts of that graph by using correct assertions. Our algorithm then determines transformers, for each state of the graph grammar, which, given the context, expressed by an assertion, of a state of the graph represented by a state of the graph grammar, decides whether a given formula is satisfied by that state of the graph, or not. Keywords: Infinitestate sys...
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
"... The starting point of this paper is McMillan's complete finite prefix of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly infinite) system behaviour from the complete finite prefix. An algorithm ..."
Abstract
 Add to MetaCart
The starting point of this paper is McMillan's complete finite prefix of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly infinite) system behaviour from the complete finite prefix. An algorithm is presented to derive from the prefix a graph rewriting system that can be used to construct the unfolding. It is shown how to generate event sequences from the graph rewriting system which is important for constructing an interactive simulator. Finally it is indicated how the graph rewriting system yields a transition system that can be used for model checking and test derivation. 1 Introduction In order to deal with the state explosion problem in validating distributed systems, many alternatives to the standard interleaving semantics have been proposed. A large class of them can be classified as partial order semantics, of which several types of event structures [Win89,BC94,Lan92] and occur...
Looking Good, Behaving Well
, 2007
"... Computer systems are so complex and crucial to our lives that we need to verify that they are correct and do not fail or risk facing enormous economical consequences, like in the case of the European Space Agency’s Ariane 5 rocket, which selfdestructed 37 seconds after launch because of a software ..."
Abstract
 Add to MetaCart
(Show Context)
Computer systems are so complex and crucial to our lives that we need to verify that they are correct and do not fail or risk facing enormous economical consequences, like in the case of the European Space Agency’s Ariane 5 rocket, which selfdestructed 37 seconds after launch because of a software malfunction, or loss of human lives, like the Therac25 radiation therapy machine, which caused at least six deaths due to overdoses of radiation because the machine was not able to detect a human error. We would like to reduce the number of such errors or even prove their absence. Many errors stem from incomplete and inconsistent specifications of the systems to construct, as they are often written in natural language text. We would instead like to create a formal specification. In order to do that, we create a formal model of the system we wish to construct, much like how an architect creates a blueprint of a house that is to be constructed. A specification, in the form of a formal model, can then be verified using