898 search results - page 50 / 180 » Transitions of the Pre-Symmetry Set |
FUIN
2007
14 years 9 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
IANDC
2006
14 years 9 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
123
click to vote
MST
2006
14 years 9 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
JSS
2002
14 years 9 months ago
2002
As a baseline for software development, a correct and complete requirements definition is one foundation of software quality. Previously, a novel approach to static testing of sof...