110 search results - page 4 / 22 » Domains of Higher-Dimensional Automata |
CONCUR
2005
Springer
14 years 1 months ago
2005
Springer
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...
ENTCS
2006
13 years 7 months ago
2006
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
ENTCS
2007
13 years 7 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
IJCSA
2007
13 years 7 months ago
2007
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...