Sciweavers

769 search results - page 6 / 154
» Simple Composition of Nets
Sort
View
APN
2010
Springer
14 years 9 days ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
AWPN
2008
274views Algorithms» more  AWPN 2008»
13 years 9 months ago
A Janus-Faced Net Component for the Prototyping of Open Systems
We introduce a Janus-faced reference net component that presents the basis for the recursive composition of complex systems from open system units. We particularly focus on the ope...
Matthias Wester-Ebbinghaus, Daniel Moldt
FUIN
2008
124views more  FUIN 2008»
13 years 7 months ago
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Pe...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
CCS
2007
ACM
14 years 1 months ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
14 years 1 months ago
Synchronous + Concurrent + Sequential = Earlier than + Not later than
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...