Sciweavers

22 search results - page 5 / 5
» Reachability in Petri Nets with Inhibitor Arcs
Sort
View
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...
GG
2010
Springer
13 years 6 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...