Sciweavers

10 search results - page 1 / 2
» Unfolding Concurrent Well-Structured Transition Systems
Sort
View
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
13 years 11 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...
APN
2010
Springer
13 years 10 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
REX
1993
13 years 9 months ago
Relationships Between Models of Concurrency
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
Mogens Nielsen, Vladimiro Sassone, Glynn Winskel
ACSD
1998
IEEE
121views Hardware» more  ACSD 1998»
13 years 9 months ago
Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
Alex Kondratyev, Jordi Cortadella, Michael Kishine...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
13 years 9 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...