148 search results - page 7 / 30 » Linear Logic on Petri Nets |
ENTCS
2008
13 years 9 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
AUTOMATICA
2004
13 years 8 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
CHARME
2001
Springer
14 years 1 months ago
2001
Springer
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
BIRTHDAY
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expres...
EMISA
2002
Springer
13 years 8 months ago
2002
Springer
DAWN is technique for modelling and verifying network algorithms, which is based on Petri nets and temporal logic. In this paper, we present a different perspective of DAWN that al...