Sciweavers

234 search results - page 25 / 47
» Proof Nets and the Identity of Proofs
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
117
Voted
DIM
2006
ACM
15 years 4 months ago
Privacy preserving multi-factor authentication with biometrics
An emerging approach to the problem of reducing the identity theft is represented by the adoption of biometric authentication systems. Such systems however present however several...
Abhilasha Bhargav-Spantzel, Anna Cinzia Squicciari...
LICS
1990
IEEE
15 years 2 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter
ENTCS
2002
103views more  ENTCS 2002»
14 years 10 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
IH
2001
Springer
15 years 2 months ago
Intellectual Property Metering
Abstract. We have developed the first hardware and software (intellectual property) metering scheme that enables reliable low overhead proofs for the number of manufactured parts a...
Farinaz Koushanfar, Gang Qu, Miodrag Potkonjak