Sciweavers

71 search results - page 1 / 15
» An Unfolding Algorithm for Synchronous Products of Transitio...
Sort
View
CONCUR
1999
Springer
13 years 8 months ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
Javier Esparza, Stefan Römer
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
13 years 10 months 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...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
13 years 8 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...
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 4 months ago
Model Checking Synchronized Products of Infinite Transition Systems
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
Stefan Wöhrle, Wolfgang Thomas
APN
2010
Springer
13 years 9 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre