CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
CONCUR
2009
Springer
14 years 6 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...
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We show how to apply Howe’s method for the proof of congruence of early bisimilarities in a higher-order process calculus with
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
CONCUR
2009
Springer
14 years 6 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 ...
CONCUR
2009
Springer
14 years 6 months ago
2009
Springer
Theories identifying well-formed systems of processes—those that are free of communication errors and enjoy strong properties such as deadlock freedom—are based either on sessi...