Sciweavers

512 search results - page 26 / 103
» Automata as Abstractions
Sort
View
KBSE
2008
IEEE
14 years 3 months ago
The Consistency of Web Conversations
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
Jeffrey Fischer, Rupak Majumdar, Francesco Sorrent...
ICST
2010
IEEE
13 years 7 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
PE
2011
Springer
214views Optimization» more  PE 2011»
13 years 3 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
APLAS
2007
ACM
14 years 19 days ago
A Probabilistic Applied Pi-Calculus
Abstract. We propose an extension of the Applied Pi
Jean Goubault-Larrecq, Catuscia Palamidessi, Angel...
ICALP
2010
Springer
14 years 1 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj