AbstractWe address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program verification and control synthesis in reactive program compilation
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
AbstractWe address the problem of generating a minimal state graph from a program, without building ...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
Compositional verification, the incremental generation and composition of the state graphs of indivi...
Graphs may be used as representations of system states in operational semantics and model checking; ...
Graphs may be used as representations of system states in operational semantics and model checking; ...
Abstract: GP (for Graph Programs) is a rule-based, nondeterministic program-ming language for solvin...
AbstractMinimization of a labelled transition system (Its) is useful e.g. while condensing the globa...
AbstractGraphs may be used as representations of system states in operational semantics and model ch...
A fundamental issue in the automated analysis of concurrent systems is the efficient generation of t...
This paper presents a method to synthesize labeled Petri nets from state-based models. Although stat...
A sequence generator is a finite graph, more general than, but akin to, the usual state diagram asso...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
AbstractWe address the problem of generating a minimal state graph from a program, without building ...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
A fundamental issue in the automated analysis of communicating systems is the efficient generation o...
Compositional verification, the incremental generation and composition of the state graphs of indivi...
Graphs may be used as representations of system states in operational semantics and model checking; ...
Graphs may be used as representations of system states in operational semantics and model checking; ...
Abstract: GP (for Graph Programs) is a rule-based, nondeterministic program-ming language for solvin...
AbstractMinimization of a labelled transition system (Its) is useful e.g. while condensing the globa...
AbstractGraphs may be used as representations of system states in operational semantics and model ch...
A fundamental issue in the automated analysis of concurrent systems is the efficient generation of t...
This paper presents a method to synthesize labeled Petri nets from state-based models. Although stat...
A sequence generator is a finite graph, more general than, but akin to, the usual state diagram asso...
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...
Abstract. In software engineering, graphical formalisms, like state-transition tables and automata, ...