Sciweavers

11 search results - page 1 / 3
» Petri Nets, Flat Languages and Linear Arithmetic
Sort
View
AC
2003
Springer
13 years 10 months ago
Synthesis of Asynchronous Hardware from Petri Nets
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...
Josep Carmona, Jordi Cortadella, Victor Khomenko, ...
LATA
2010
Springer
13 years 3 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
CAAP
1990
13 years 8 months ago
Petri Nets as Models of Linear Logic
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...
Uffe Engberg, Glynn Winskel
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
13 years 7 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...