Sciweavers

395 search results - page 1 / 79
» Polynomial Approximations for Model Checking
Sort
View
ERSHOV
2003
Springer
13 years 10 months ago
Polynomial Approximations for Model Checking
Nikolay V. Shilov, Natalya Olegovna Garanina
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
13 years 11 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
AB
2007
Springer
13 years 11 months ago
Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
Venkatesh Mysore, Bud Mishra
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
13 years 9 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
ACSD
2003
IEEE
91views Hardware» more  ACSD 2003»
13 years 10 months ago
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
Javier Esparza