Sciweavers

128 search results - page 7 / 26
» An Implicit Characterization of PSPACE
Sort
View
FSTTCS
2008
Springer
14 years 11 months ago
The unfolding of general Petri nets
The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a core...
Jonathan Hayman, Glynn Winskel
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
15 years 4 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
LICS
2008
IEEE
15 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
EFDBS
2001
14 years 11 months ago
Augmenting SQL with Dynamic Restructuring to Support Interoperability in a Relational Federation
In this work, we consider augmenting SQL with constructs allowing dynamic restructuring. Dynamic restructuring occurs naturally in a framework including second-order capabilities f...
Catharine M. Wyss, Felix I. Wyss, Dirk Van Gucht
ECSCW
2007
14 years 11 months ago
Cues to Common Knowledge
Abstract. We show that asynchronous collaboration can be made more effective by providing cues to common knowledge. We demonstrate this by empirically comparing two user interfaces...
Nick Bryan-Kinns, Patrick G. T. Healey, D. Papwort...