169 search results - page 2 / 34 » Comparing the Expressive Power of Well-Structured Transition... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
FUIN
2008
13 years 5 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
IANDC
2011
13 years 12 days ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
CCS
2004
ACM
13 years 10 months ago
2004
ACM
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
APN
2006
Springer
13 years 7 months ago
2006
Springer
Petri net schemata are an intuitive and expressive approach to describe high-level Petri nets. A Petri net schema is a Petri net with edges and transitions inscribed by terms and B...