Sciweavers

129 search results - page 5 / 26
» Completeness Results for Linear Logic on Petri Nets
Sort
View
APN
2007
Springer
14 years 1 months ago
Petri Nets, Discrete Physics, and Distributed Quantum Computation
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
Samson Abramsky
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
13 years 12 months 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
MEMBRANE
2005
Springer
14 years 28 days ago
P Systems, Petri Nets, and Program Machines
Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtai...
Pierluigi Frisco
TII
2010
113views Education» more  TII 2010»
13 years 2 months ago
An Automated Framework for Formal Verification of Timed Continuous Petri Nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
Marius Kloetzer, Cristian Mahulea, Calin Belta, Ma...
CONCUR
2000
Springer
13 years 11 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny