Sciweavers

7 search results - page 1 / 2
» Simulation and Bisimulation over One-Counter Processes
Sort
View
105
Voted
STACS
2000
Springer
15 years 3 months ago
Simulation and Bisimulation over One-Counter Processes
Petr Jancar, Antonín Kucera, Faron Moller
LICS
2009
IEEE
15 years 7 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
FSMNLP
2009
Springer
14 years 10 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
99
Voted
QEST
2010
IEEE
14 years 10 months ago
The Measurable Space of Stochastic Processes
Abstract--We introduce a stochastic extension of CCS endowed with structural operational semantics expressed in terms of measure theory. The set of processes is organised as a meas...
Luca Cardelli, Radu Mardare
MFCS
1991
Springer
15 years 3 months ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone