36 search results - page 4 / 8 » concur 2009 |
113
click to vote
CONCUR
2010
Springer
15 years 3 months ago
2010
Springer
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
113
Voted
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Several programming constructs have recently been proposed with the purpose of enabling the programmer to encode declassifying information flows within a program that complies wi...
114
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
We propose how to present and compute a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present ...
125
Voted
CONCUR
2009
Springer
15 years 5 months ago
2009
Springer
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...