Sciweavers

191 search results - page 5 / 39
» Transition systems, link graphs and Petri nets
Sort
View
ECEASST
2006
103views more  ECEASST 2006»
13 years 8 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
CONCUR
1999
Springer
14 years 8 days 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
TSMC
1998
152views more  TSMC 1998»
13 years 7 months ago
Discrete event representation of qualitative models using Petri nets
—The paper discusses how Petri nets may be used for the qualitative modeling of physical systems. The qualitative state of a system is represented by the marking of the net. The ...
Alessandra Fanni, Alessandro Giua
IANDC
2006
97views more  IANDC 2006»
13 years 8 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
AC
2003
Springer
14 years 1 months ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau