Sciweavers

40 search results - page 5 / 8
» Proof Nets, Garbage, and Computations
Sort
View
CONCUR
2000
Springer
15 years 1 months 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
SPIN
2001
Springer
15 years 2 months ago
From Model Checking to a Temporal Proof
ions Using SPIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 Marsha Chechik, Benet Devereux, Arie Gurfinkel (University of Toronto) Imp...
Doron Peled, Lenore D. Zuck
IJFCS
2011
78views more  IJFCS 2011»
14 years 4 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom
IEEEARES
2010
IEEE
14 years 7 months ago
Using Smart Cards for Tamper-Proof Timestamps on Untrusted Clients
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...
Guenther Starnberger, Lorenz Froihofer, Karl M. G&...
CORR
2006
Springer
108views Education» more  CORR 2006»
14 years 9 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud