L. Aceto, A. Ingolfsdottir & J. Srba (2011):
Advanced Topics in Bisimulation and Coinduction, chapter The Algorithmics of Bisimilarity,
pp. 100–172.
Cambridge University Press,
doi:10.1017/CBO9780511792588.
Andres Aristizabal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino & Frank D. Valencia (2011):
Deriving Labels and Bisimilarity for Concurrent Constraint Programming.
In: FOSSACS,
LNCS.
Springer,
pp. 138–152,
doi:10.1007/978-3-642-19805-2_10.
Andres Aristizabal, Filippo Bonchi, Luis Pino & Frank D. Valencia (2012):
Partition Refinement for Bisimilarity in CCP.
In: SAC.
ACM,
pp. 88–93,
doi:10.1145/2245276.2245296.
Paolo Baldan, Andrea Bracciali & Roberto Bruni (2007):
A semantic framework for open processes.
Theor. Comput. Sci. 389(3),
pp. 446–483,
doi:10.1016/j.tcs.2007.09.004.
Frank S. de Boer, Alessandra Di Pierro & Catuscia Palamidessi (1995):
Nondeterminism and Infinite Computations in Constraint Programming.
Theor. Comput. Sci. 151(1),
pp. 37–78,
doi:10.1016/0304-3975(95)00047-Z.
Filippo Bonchi, Fabio Gadducci & Giacoma Valentina Monreale (2009):
Reactive Systems, Barbed Semantics, and the Mobile Ambients.
In: FOSSACS,
LNCS,
pp. 272–287,
doi:10.1007/978-3-642-00596-1_20.
Filippo Bonchi, Barbara König & Ugo Montanari (2006):
Saturated Semantics for Reactive Systems.
In: LICS.
IEEE,
pp. 69–80,
doi:10.1109/LICS.2006.46.
Filippo Bonchi & Ugo Montanari (2009):
Minimization Algorithm for Symbolic Bisimilarity.
In: ESOP,
LNCS.
Springer,
pp. 267–284,
doi:10.1007/978-3-642-00590-9_20.
Roberto Bruni, Hernán C. Melgratti & Ugo Montanari (2011):
A Connector Algebra for P/T Nets Interactions.
In: CONCUR,
LNCS.
Springer,
pp. 312–326,
doi:10.1007/978-3-642-23217-6_21.
Jean-Claude Fernandez (1989):
An Implementation of an Efficient Algorithm for Bisimulation Equivalence.
Sci. Comput. Program. 13(1),
pp. 219–236,
doi:10.1016/0167-6423(90)90071-K.
G.L. Ferrari, S. Gnesi, U. Montanari, M. Pistore & G. Ristori (1998):
Verifying Mobile Processes in the HAL Environment.
In: CAV.
Springer,
pp. 511–515,
doi:10.1007/BFb0028772.
Fabio Gadducci & Ugo Montanari (2000):
The tile model.
In: Proof, Language, and Interaction.
The MIT Press,
pp. 133–166.
O. H. Jensen. (2006):
Mobile Processes in Bigraphs.
University of Cambridge.
Paris C. Kanellakis & Scott A. Smolka (1983):
CCS Expressions, Finite State Processes, and Three Problems of Equivalence.
In: PODC.
ACM,
pp. 228–240,
doi:10.1145/800221.806724.
Sophia Knight, Catuscia Palamidessi, Prakash Panangaden & Frank D. Valencia (2012):
Spatial Information Distribution in Constraint-based Process Calculi (Extended Version).
Technical Report.
INRIA.
Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi & Alan Schmitt (2011):
On the expressiveness and decidability of higher-order process calculi.
Inf. Comput. 209(2),
pp. 198–226,
doi:10.1016/j.ic.2010.10.001.
N. P. Mendler, Prakash Panangaden, Philip J. Scott & R. A. G. Seely (1995):
A Logical View of Concurrent Constraint Programming.
Nord. J. Comput. 2(2),
pp. 181–220.
Robin Milner (1980):
A Calculus of Communicating Systems.
Lecture Notes in Computer Science 92.
Springer-Verlag New York, Inc.,
doi:10.1007/3-540-10235-3.
Robin Milner (1999):
Communicating and mobile systems: the π-calculus.
Cambridge University Press.
Robin Milner & Davide Sangiorgi (1992):
Barbed Bisimulation.
In: ICALP,
LNCS.
Springer,
pp. 685–695,
doi:10.1007/3-540-55719-9_114.
Carlos Olarte & Frank D. Valencia (2008):
Universal concurrent constraint programing: symbolic semantics and applications to security.
In: SAC.
ACM,
pp. 145–150,
doi:10.1145/1363686.1363726.
Catuscia Palamidessi & Frank D. Valencia (2001):
A Temporal Concurrent Constraint Programming Calculus.
In: CP,
LNCS.
Springer,
pp. 302–316,
doi:10.1007/3-540-45578-7_21.
Davide Sangiorgi & Jan Rutten (2012):
Advanced Topics in Bisimulation and Coinduction.
Cambridge University Press,
doi:10.1017/CBO9780511792588.
Vijay A. Saraswat, Radha Jagadeesan & Vineet Gupta (1994):
Foundations of Timed Concurrent Constraint Programming.
In: LICS.
IEEE,
pp. 71–80,
doi:10.1109/LICS.1994.316085.
Vijay A. Saraswat & Martin C. Rinard (1990):
Concurrent Constraint Programming.
In: POPL.
ACM Press,
pp. 232–245,
doi:10.1145/96709.96733.
Vijay A. Saraswat, Martin C. Rinard & Prakash Panangaden (1991):
Semantic Foundations of Concurrent Constraint Programming.
In: POPL.
ACM Press,
pp. 333–352,
doi:10.1145/99583.99627.
Pawel Sobocinski (2010):
Representations of Petri Net Interactions.
In: CONCUR,
LNCS.
Springer,
pp. 554–568,
doi:10.1007/978-3-642-15375-4_38.
Pawel Sobocinski (2012):
Relational presheaves as labelled transition systems.
In: In proceedings CMCS,
To appear in LNCS,
doi:10.1007/978-3-642-32784-1_3.
Björn Victor & Faron Moller (1994):
The Mobility Workbench - A Tool for the pi-Calculus.
In: CAV,
LNCS.
Springer,
pp. 428–440,
doi:10.1007/3-540-58179-0_73.