SwePub - sökning: L773:9783540853602 OR L773:978...

Träfflista för sökning "L773:9783540853602 OR L773:9783540853619 OR L773:354085360X "

Sökning: L773:9783540853602 OR L773:9783540853619 OR L773:354085360X

Resultat 1-2 av 2

Sortera/gruppera träfflistan

Sortering: Träffar per sida:

Numrering	Referens	Omslagsbild	Hitta
1.	Cranen, Sjoerd, et al. (författare) A rule format for associativity 2008 Ingår i: CONCUR 2008 - Concurrency Theory. - Berlin : Springer Berlin/Heidelberg. - 9783540853602 - 9783540853619 - 354085360X ; , s. 447-461 Konferensbidrag (refereegranskat)abstract We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek's spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism.
2.	Abdulla, Parosh Aziz, et al. (författare) R-automata 2008 Ingår i: CONCUR 2008 - Concurrency Theory. - Berlin : Springer-Verlag. - 9783540853602 ; , s. 67-81 Konferensbidrag (refereegranskat)abstract We introduce R-automata - finite state machines which operate on a finite number of unbounded counters. The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. R-automata can be, for example, used to model systems with resources (modeled by the counters) which are consumed in small parts but which can be replenished at once. We define the language accepted by an R-automaton relative to a natural number D as the set of words allowing a run along which no counter value exceeds D. As the main result, we show decidability of the universality problem, i.e., the problem whether there is a number D such that the corresponding language is universal. We present a proof based on finite monoids and the factorization forest theorem. This theorem was applied for distance automata in [12] - a special case of R-automata with one counter which is never reset. As a second technical contribution, we extend the decidability result to R-automata with Buchi acceptance conditions.

Skapa referenser, mejla, bekava och länka

Länka till träfflistan

Resultat 1-2 av 2

Träfflista för sökning "L773:9783540853602 OR L773:9783540853619 OR L773:354085360X "

Avgränsa träffmängd