Sciweavers

374 search results - page 15 / 75
» On Communicating Automata with Bounded Channels
Sort
View
CONCUR
1999
Springer
15 years 10 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
DAGSTUHL
2006
15 years 7 months ago
An Algorithm for Matching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SO...
Peter Massuthe, Karsten Wolf
ICC
2007
IEEE
16 years 10 days ago
UWB Based Positioning in Multipath Channels: CRBs for AOA and for Hybrid TOA-AOA Based Methods
— In this paper we consider UWB (ultra wide band) based positioning. We derive the CRBs (Cramer Rao bound) for AOA (angle of arrival) and for hybrid method using both AOA and TOA...
Achraf Mallat, Jérôme Louveaux, Luc V...
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 10 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
LPNMR
2001
Springer
15 years 10 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä