258 search results - page 8 / 52 » Weak Bisimulation Approximants |
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
TCS
2008
14 years 9 months ago
2008
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
CONCUR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
105
click to vote
CBSE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...