744 search results - page 9 / 149 » Observations on the Decidability of Transitions |
133
click to vote
LFCS
2007
Springer
15 years 8 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...
109
click to vote
BPM
2008
Springer
15 years 3 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...
119
Voted
CORR
2010
Springer
15 years 1 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...
110
click to vote
CAV
2008
Springer
15 years 3 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...
117
click to vote
ICLP
2003
Springer
15 years 7 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...