Sciweavers

FSTTCS
2010
Springer
13 years 9 months ago
Fast equivalence-checking for normed context-free processes
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
Wojciech Czerwinski, Slawomir Lasota
IANDC
2010
68views more  IANDC 2010»
13 years 10 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
TCS
1998
13 years 11 months ago
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
We prove that bisimulation equivalence is decidable for normed pushdown processes.
Colin Stirling
JCSS
2000
98views more  JCSS 2000»
13 years 11 months ago
Rooted Branching Bisimulation as a Congruence
This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote...
Wan Fokkink
TCS
2008
13 years 11 months ago
Petri nets are less expressive than state-extended PA
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
Mojmír Kretínský, Vojtech Reh...
GG
2008
Springer
14 years 18 days ago
Network Applications of Graph Bisimulation
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
Pietro Cenciarelli, Daniele Gorla, Emilio Tuosto
LICS
1991
IEEE
14 years 3 months ago
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
Hans Hüttel, Colin Stirling
CONCUR
1995
Springer
14 years 3 months ago
Bisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
Matthew Hennessy, Julian Rathke
CONCUR
2003
Springer
14 years 4 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
CONCUR
2009
Springer
14 years 6 months ago
Partially-Commutative Context-Free Processes
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...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...