Sciweavers

396 search results - page 18 / 80
» Factor Automata of Automata and Applications
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
SCP
2010
126views more  SCP 2010»
13 years 5 months ago
Component simulation-based substitutivity managing QoS and composition issues
Several scientic bottlenecks have been identied in existing component-based approaches. em, we focus on the identication of a relevant abstraction for the component expression ...
Pierre-Cyrille Héam, Olga Kouchnarenko, J&e...
FORMATS
2004
Springer
13 years 11 months ago
Decomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
Dilsun Kirli Kaynar, Nancy A. Lynch
ICWS
2004
IEEE
13 years 9 months ago
Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
Andreas Wombacher, Peter Fankhauser, Erich J. Neuh...
ACTA
2010
104views more  ACTA 2010»
13 years 7 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...