Results 1  10
of
65,793
Temporal reachability graphs
 ACM MobiCom
, 2012
"... While a natural fit for modeling and understanding mobile networks, timevarying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in timevarying ones. In this paper, we introduce the notion of temporal reachability graphs. A (τ, δ)rea ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
While a natural fit for modeling and understanding mobile networks, timevarying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in timevarying ones. In this paper, we introduce the notion of temporal reachability graphs. A (τ, δ)reachability
Symbolic Reachability Graph and Partial Symmetries
 In Application and Theory of Petri Nets 1995, SpringerVerlag, LNCS 935
, 1995
"... The construction of symbolic reachability graphs is a useful technique for reducing state explosion in Highlevel Petri nets. Such a reduction is obtained by exploiting the symmetries of the whole net [1]. In this paper, we extend this method to deal with partial symmetries. In a first time, we i ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
The construction of symbolic reachability graphs is a useful technique for reducing state explosion in Highlevel Petri nets. Such a reduction is obtained by exploiting the symmetries of the whole net [1]. In this paper, we extend this method to deal with partial symmetries. In a first time, we
Modular Construction of Time Petri Net Reachability Graphs
"... Abstract—Time Petri nets are an extension of Petri nets formalism with time specifications on transitions. The formalism is convenient for model distributed systems and enables capturing the time characteristics of distributed system activities. The primary tool for models behaviour understanding is ..."
Abstract
 Add to MetaCart
is reachability graph. In [10] the algorithm for constructing Time Petri net reachability graph was suggested. It is based on essential states, but the number of states in the resultant net reachability graph increases when time specification are scaled up, while the behaviour of the net is invariant under time
Reachability Graph of Finite & Deterministic DEVS
 Proceedings of 2006 DEVS Symposium
, 2006
"... Abstract — This paper shows how to generate a finitevertex graph, called a reachability graph for discrete event system specification (DEVS) network. The reachability graph is isomorphic to a given original DEVS network in terms of behavior but the number of vertices as well as the number of edges ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
Abstract — This paper shows how to generate a finitevertex graph, called a reachability graph for discrete event system specification (DEVS) network. The reachability graph is isomorphic to a given original DEVS network in terms of behavior but the number of vertices as well as the number
Hierarchical reachability graph generation for Petri nets
 Universität Dortmund, Fachbereich Informatik, Forschungsbericht Nr. 660
, 1997
"... Reachability analysis is the most general approach to analyze Petri nets. Due to state space explosion, generation of the reachability set and reachability graph becomes intractable even for moderately sized nets with the known approaches. This paper presents a new method to generate and represent t ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Reachability analysis is the most general approach to analyze Petri nets. Due to state space explosion, generation of the reachability set and reachability graph becomes intractable even for moderately sized nets with the known approaches. This paper presents a new method to generate and represent
A Symbolic Reachability Graph for Coloured Petri Nets
, 1997
"... Coloured Petri nets are well suited to the modelling of symmetric systems. Model symmetries can be usefully exploited for the sake of analysis efficiency as well as for modelling convenience. ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
Coloured Petri nets are well suited to the modelling of symmetric systems. Model symmetries can be usefully exploited for the sake of analysis efficiency as well as for modelling convenience.
Finitely Representing Infinite Reachability Graphs Of CFSMs With Graph Grammars
 IN FORTE/PSTV'96. CHAPMAN AND
, 1996
"... We propose here an algorithm enabling to represent, in a finite way, some infinite reachability graphs of communicating finitestate machines, by using a graph grammar. The modelchecking algorithm presented in [BQ96] uses that finite representation for verifying properties of the infinite graph. In ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We propose here an algorithm enabling to represent, in a finite way, some infinite reachability graphs of communicating finitestate machines, by using a graph grammar. The modelchecking algorithm presented in [BQ96] uses that finite representation for verifying properties of the infinite graph
Finite Symbolic Reachability Graphs for HighLevel Petri Nets
, 1997
"... The construction of reachability graphs (rg) is one of the most useful techniques to analyse the properties of concurrent systems modelled by Petri nets. Such a graph describes all the possible behaviours of the system, and its construction is straightforward. When highlevel Petri nets are under co ..."
Abstract
 Add to MetaCart
The construction of reachability graphs (rg) is one of the most useful techniques to analyse the properties of concurrent systems modelled by Petri nets. Such a graph describes all the possible behaviours of the system, and its construction is straightforward. When highlevel Petri nets are under
Obtaining MemoryEfficient Reachability Graph Representations Using the SweepLine Method
, 2004
"... This paper is concerned with a memoryefficient representation of reachability graphs. We describe a technique that enables us to represent each reachable marking in a number of bits close to the theoretical minimum needed for explicit state enumeration. The technique maps each state vector onto a n ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper is concerned with a memoryefficient representation of reachability graphs. We describe a technique that enables us to represent each reachable marking in a number of bits close to the theoretical minimum needed for explicit state enumeration. The technique maps each state vector onto a
Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs
"... Abstract. This demonstration shows how two complementary tools can be combined for the efficient verification of EPC business process models. In a first step, the tool xoEPC is used to identify controlflow errors in an EPC based on reduction rules. While this approach is efficient, it may result in ..."
Abstract
 Add to MetaCart
in a partially reduced EPC since the set of reduction rules is not complete. In a second step, this partially reduced EPC can then be loaded into ProM. In ProM there is a conversion plugin that calculates the reachability graph and verifies EPC soundness. Though this approach is complete, it can
Results 1  10
of
65,793