Sciweavers

102 search results - page 5 / 21
» Petri Nets as Models of Linear Logic
Sort
View
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
14 years 2 days ago
Net Reductions for LTL Model-Checking
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...
Javier Esparza, Claus Schröter
ASYNC
2001
IEEE
164views Hardware» more  ASYNC 2001»
13 years 11 months ago
Synthesis and Implementation of a Signal-Type Asynchronous Data Communication Mechanism
This paper describes the synthesis and hardware implementation of a signal-type asynchronous data communication mechanism (ACM). Such an ACM can be used in systems where a data-dr...
Alexandre Yakovlev, Fei Xia, Delong Shang
FUIN
2010
172views more  FUIN 2010»
13 years 4 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
AUTOMATICA
2004
109views more  AUTOMATICA 2004»
13 years 7 months ago
Optimal stationary behavior for a class of timed continuous Petri nets
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...
Bruno Gaujal, Alessandro Giua
EMISA
2002
Springer
13 years 7 months ago
DAWN for component based systems - just a different perspective
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...
Ekkart Kindler