J. A. Bergstra
J. W. Klop
1985
Algebra of Communicating Processes with Abstraction
Theor. Comput. Sci.
37
77–121
10.1016/0304-3975(85)90088-X
Jan A. Bergstra
Jan Willem Klop
1984
Process Algebra for Synchronous Communication
Information and Control
60
1-3
109–137
10.1016/S0019-9958(84)80025-X
Jean Berstel
Luc Boasson
Olivier Carton
Jean-Eric Pin
Antonio Restivo
2010
The expressive power of the shuffle product
Inf. Comput.
208
11
1258–1272
10.1016/j.ic.2010.06.002
Ahmed Bouajjani
Markus Müller-Olm
Tayssir Touili
2005
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
CONCUR
473–487
10.1007/11539452_36
S. Christensen
1993
Decidability and Decomposition in Process Algebras
Department of Computer Science, University of Edinburgh
W. Czerwiński
S. B. Fröschle
S. Lasota
2009
Partially-Commutative Context-Free Processes
CONCUR
259–273
10.1007/978-3-642-04081-8_18
W. Czerwiński
S. B. Fröschle
S. Lasota
2011
Partially-commutative context-free processes: expressibility and tractability
Inf. Comput.
209
5
782–798
10.1016/j.ic.2010.12.003
W. Czerwiński
P. Hofman
S. Lasota
2012
Reachability problem for weak multi-pushdown automata
To appear
J. Esparza
1997
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
Fundam. Inform.
31
1
13–25
10.1007/3-540-60249-6_54
Jay L. Gischer
1981
Shuffle Languages, Petri Nets, and Context-Sensitive Grammars
Commun. ACM
24
9
597–605
10.1145/358746.358767
Y. Hirshfeld
M. Jerrum
1999
Bisimulation Equivalence Is Decidable for Normed Process Algebra
ICALP
412–421
10.1007/3-540-48523-6_38
R. Mayr
2000
Process Rewrite Systems
Inf. Comput.
156
1-2
264–286
10.1006/inco.1999.2826
A. W. Mazurkiewicz
1988
Basic notions of trace theory
REX Workshop
285–363
M.-J. Nederhof
G. Satta
S. Shieber
2003
Partially Ordered Multiset Context-Free Grammars And Free-Word-Order Parsing
Proc. 8th Intl Workshop on Parsing Technologies
171–182
J. Srba
2002
Roadmap of Infinite Results
Bulletin of the EATCS
78
163–175