|
24
|
Undecidable Equivalences for Basic Parallel Processes
– Hans Hüttel
- 1993
|
|
7
|
Weak bisimilarity with infinite-state systems can be decided in polynomial time
– Antonín Kučera, Richard Mayr
- 1999
|
|
4
|
Semi-Groups Acting on Context-Free Graphs
– Géraud Sénizergues, Universit'e De Bordeaux I
|
|
|
Decidability and complexity of equivalences for simple process algebras
– Jitka Stribrna
- 1998
|
|
14
|
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
– Olaf Burkart, Didier Caucal, Bernhard Steffen
- 1994
|
|
5
|
On the Decidability of Process Equivalences for the pi-calculus
– Mads Dam
- 1994
|
|
50
|
Verification on Infinite Structures
– Olaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen
- 2000
|
|
36
|
Bisimulation Collapse and the Process Taxonomy
– Olaf Burkart, Didier Caucal, Bernhard Steffen
- 1996
|
|
2
|
Checking NFA equivalence with bisimulations up to congruence
– Damien Pous
|
|
73
|
π-Calculus, Internal Mobility, and Agent-Passing Calculi
– Davide Sangiorgi
- 1995
|
|
6
|
CPO Models for a Class of GSOS Languages
– Luca Aceto, Anna Ingólfsdóttir
- 1995
|
|
1
|
Interpreting functions as π-calculus processes: a tutorial
– Davide Sangiorgi
- 1999
|
|
92
|
Equality In Lazy Computation Systems
– Douglas J. Howe
- 1998
|
|
|
Delayed Choice for Process Algebra With Abstraction
– Pedro D'Argenio, Sjouke Mauw, S. Mauw
- 1995
|
|
36
|
A general conservative extension theorem in process algebra
– Pedro R. D’Argenio, Chris Verhoef
- 1994
|
|
6
|
Axiomatisations of Weak Equivalences for De Simone Languages
– Irek Ulidowski
- 1995
|
|
7
|
Finite axiom systems for testing preorder and De Simone Process Languages
– Irek Ulidowski
- 2000
|
|
2
|
Ordered SOS Process Languages for Branching and Eager Bisimulations
– Irek Ulidowski, Iain Phillips
- 2002
|
|
22
|
Delayed choice: an operator for joining Message Sequence Charts
– Jos Baeten, Sjouke Mauw, J. C. M. Baeten, S. Mauw
- 1994
|
