391 search results - page 63 / 79 » Compositionality for Probabilistic Automata |
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
FSTTCS
2003
Springer
14 years 21 days ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
HYBRID
1995
Springer
13 years 11 months ago
1995
Springer
The theory of supervisory control of discrete event systems is extended to the real-time setting. The real-time behavior of a system is represented by the set of all possible time...