48 search results - page 9 / 10 » Model Checking Abstract State Machines with Answer Set Progr... |
ATVA
2005
Springer
13 years 11 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 ...
ICTAI
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--Today's molecular biology is confronted with enormous amounts of data, generated by new high-throughput technologies, along with an increasing number of biological m...
FUIN
2007
13 years 6 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
ISSTA
2004
ACM
13 years 11 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...