Sciweavers

3353 search results - page 381 / 671
» Laver and set theory
Sort
View
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
15 years 8 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
BIRTHDAY
2008
Springer
15 years 8 months ago
Transformations in Reconfigurable Place/Transition Systems
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...
Ulrike Prange, Hartmut Ehrig, Kathrin Hoffmann, Ju...
CCS
2008
ACM
15 years 8 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
CIE
2008
Springer
15 years 8 months ago
A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
Liesbeth De Mol, Maarten Bullynck
169
Voted
AI
2006
Springer
15 years 8 months ago
A Smart Home Agent for Plan Recognition
Assistance to people suffering from cognitive deficiencies in a smart home raises complex issues. Plan recognition is one of them. We propose a formal framework for the recognition...
Bruno Bouchard, Sylvain Giroux, Abdenour Bouzouane