Sciweavers

44 search results - page 3 / 9
» Partial Order Semantics of Types of Nets
Sort
View
APN
2005
Springer
13 years 11 months ago
The (True) Concurrent Markov Property and Some Applications to Markov Nets
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
Samy Abbes
CSL
1999
Springer
13 years 9 months ago
Anti-Symmetry of Higher-Order Subtyping
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
Adriana B. Compagnoni, Healfdene Goguen
BIRTHDAY
2008
Springer
13 years 7 months ago
Models of Computation: A Tribute to Ugo Montanari's Vision
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...
Roberto Bruni, Vladimiro Sassone
SDB
1995
178views Database» more  SDB 1995»
13 years 9 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
APN
2008
Springer
13 years 7 months ago
Faster Unfolding of General Petri Nets Based on Token Flows
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
Robin Bergenthum, Robert Lorenz, Sebastian Mauser