Sciweavers

941 search results - page 146 / 189
» History-Dependent Petri Nets
Sort
View
GG
2008
Springer
13 years 10 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
APLAS
2010
ACM
13 years 10 months ago
Reasoning about Computations Using Two-Levels of Logic
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
Dale Miller
ENTCS
2008
152views more  ENTCS 2008»
13 years 9 months ago
Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. It is based on Augur 1, a tool which can analyze graph transforma...
Barbara König, Vitali Kozioura
ENTCS
2006
131views more  ENTCS 2006»
13 years 9 months ago
The Case for Analog Circuit Verification
The traditional approach to validate analog circuits is to utilize extensive SPICElevel simulations. The main challenge of this approach is knowing when all important corner cases...
Chris J. Myers, Reid R. Harrison, David Walter, Ni...
IJFCS
2008
166views more  IJFCS 2008»
13 years 9 months ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
Hsu-Chun Yen