744 search results - page 9 / 149 » Observations on the Decidability of Transitions |
LFCS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
BPM
2008
Springer
13 years 11 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
CORR
2010
Springer
13 years 9 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...
CAV
2008
Springer
13 years 11 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
ICLP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...