Sciweavers

102 search results - page 10 / 21
» Petri Nets as Models of Linear Logic
Sort
View
LATA
2010
Springer
13 years 7 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
SMC
2007
IEEE
105views Control Systems» more  SMC 2007»
14 years 3 months ago
Performance evaluation of petri nets execution algorithms
— In this paper we present a performance evaluation of interpreted and centralized implementation techniques of Petri nets. These implementation techniques allow the translation ...
Ramon Piedrafita Moreno, José Luis Villarro...
CONCUR
2000
Springer
14 years 11 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
FSTTCS
2009
Springer
14 years 3 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
ICCSA
2005
Springer
14 years 2 months ago
Modelling of Process of Electronic Signature with Petri Nets and (Max, Plus) Algebra
This article discusses the modelling and the evaluation of process of electronic signature (ES). According to a certain point of view, this process can be shown as a class of Dynam...
Ahmed Nait-Sidi-Moh, Maxime Wack