656 search results - page 60 / 132 » A Formalization of Transition P Systems |
DCG
2006
15 years 16 days ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
116
Voted
TCS
2002
15 years 4 days ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
89
Voted
CAV
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
ICFEM
2009
Springer
15 years 7 months ago
2009
Springer
An extension to action systems is presented facilitating the modeling of continuous behavior in the discrete domain. The original action system formalism has been developed by Back...
108
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...