11 search results - page 1 / 3 » On Recognizable Stable Trace Languages |
FOSSACS
2000
Springer
13 years 8 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
FCT
1999
Springer
13 years 8 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
DLT
2006
13 years 5 months ago
2006
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
ISSTA
2012
ACM
11 years 6 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...