Sciweavers

41 search results - page 7 / 9
» Synchronizing sequences on a class of unbounded systems usin...
Sort
View
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 12 days ago
Unfolding Concurrent Well-Structured Transition Systems
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...
Frédéric Herbreteau, Grégoire...
SBCCI
2004
ACM
127views VLSI» more  SBCCI 2004»
13 years 11 months ago
A formal software synthesis approach for embedded hard real-time systems
Software synthesis is defined as the task of translating a specification into a software program, in a general purpose language, in such a way that this software can be compiled...
Raimundo S. Barreto, Marília Neves, Meuse N...
FUIN
2007
120views more  FUIN 2007»
13 years 6 months ago
Concurrent Turing Machines
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
Berndt Farwer, Manfred Kudlek, Heiko Rölke
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
13 years 10 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
WWW
2004
ACM
14 years 7 months ago
Analysis of interacting BPEL web services
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...
Xiang Fu, Tevfik Bultan, Jianwen Su