250 search results - page 21 / 50 » State Space Representation for Verification of Open Systems |
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
TII
2010
14 years 4 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
TASLP
2010
14 years 4 months ago
2010
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
IJAIT
2006
14 years 9 months ago
2006
We present MABLE, a fully implemented programming language for multiagent systems, which is intended to support the automatic verification of such systems via model checking. In a...