6 search results - page 2 / 2 » Using UML state machines and petri nets for the quantitative... |
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...