81 search results - page 12 / 17 » On the Computation of Stubborn Sets of Colored Petri Nets |
RSP
1998
IEEE
14 years 5 days ago
1998
IEEE
The complexity of distributed systems is a problem when designers want to evaluate their safety and liveness. Often, they are built by integration of existing components with newl...
CRIWG
2007
13 years 9 months ago
2007
Abstract. This paper presents Relations Graph – GR a methodology to automate the generation of coordination mechanisms in computational environments. GR explores encapsulation an...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
APSCC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We discuss a learning model that enables the creation of optimal learning strategies that suit learners’ needs. A customized learning content is delivered to learners as mana...
ICCAD
1996
IEEE
14 years 2 days ago
1996
IEEE
We give a denotational framework (a "meta model") within which certain properties of models of computation can be understood and compared. It describes concurrent proces...