Sciweavers

24 search results - page 3 / 5
» Reachability Games on Extended Vector Addition Systems with ...
Sort
View
ECEASST
2006
103views more  ECEASST 2006»
13 years 4 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
SPIN
2010
Springer
13 years 3 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
CSMR
2007
IEEE
13 years 11 months ago
Consistently Incorporating Changes to Evolve Transition-based Systems
Evolving software-intensive systems from one consistent state to another is a challenging activity due to the intricate inter-dependencies among the components. In this paper, we ...
Mahadevan Subramaniam, Harvey P. Siy
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
13 years 10 months ago
Flat Counter Automata Almost Everywhere!
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 ...
Jérôme Leroux, Grégoire Sutre
AUTOMATICA
2004
112views more  AUTOMATICA 2004»
13 years 4 months ago
Ellipsoidal parameter or state estimation under model uncertainty
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
Boris T. Polyak, Sergey A. Nazin, Cécile Du...