Sciweavers

1014 search results - page 164 / 203
» ''What Is a Petri Net
Sort
View
FAC
2002
66views more  FAC 2002»
13 years 9 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
FUIN
2002
63views more  FUIN 2002»
13 years 9 months ago
Probabilistic Cluster Unfoldings
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
Stefan Haar
IANDC
2002
84views more  IANDC 2002»
13 years 9 months ago
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
Y. Abramson, Alexander Moshe Rabinovich
JSI
1998
125views more  JSI 1998»
13 years 9 months ago
The Algebraic Framework for Object-Oriented Systems
Abstract. Category Theory is introduced as the mathematical model for object-oriented systems which are distributed, heterogeneous, real-time, embedded, and open-ended. Each object...
D. H. H. Yoon
TCAD
1998
82views more  TCAD 1998»
13 years 9 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...