Sciweavers

66 search results - page 12 / 14
» Diagnosability of bounded Petri nets
Sort
View
DCFS
2011
66views more  DCFS 2011»
12 years 7 months ago
Kleene Theorems for Product Systems
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade
ATVA
2007
Springer
226views Hardware» more  ATVA 2007»
14 years 1 months ago
Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
David Walter, Scott Little, Chris J. Myers
HYBRID
2003
Springer
14 years 24 days ago
Modeling and Control of SMT Manufacturing Lines Using Hybrid Dynamic Systems
Abstract. In this paper we show how hybrid control and modeling techniques can be put to work for solving a problem of industrial relevance in Surface Mount Technology (SMT) manufa...
Leandro G. Barajas, Ashish Kansal, Abhinav Saxena,...
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
FOSSACS
2000
Springer
13 years 11 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin