@InProceedings(laneve.parrow.ea:solo-diagrams ,author = {Cosimo Laneve and Joachim Parrow and Bj{\"o}rn Victor} ,title = {Solo Diagrams} ,booktitle = {Proceedings of TACS 2001} ,pages = {127-144} ,year = 2001 ,editor = {Naoki Kobayashi and Benjamin C. Pierce} ,volume = 2215 ,series = {Lecture Notes in Computer Science} ,publisher = {Springer-Verlag} ,keywords = {fusion calculus, expressiveness, graphical formalism} ,url = {http://user.it.uu.se/~victor/tr/solodiagrams.shtml} ,abstract = {We address the problems of implementing the replication operator efficiently in the solos calculus---a calculus of mobile processes without prefix. This calculus is expressive enough to admit an encoding of the whole fusion calculus and thus the pi-calculus. We show that nested occurrences of replication can be avoided, that the size of replicated terms can be limited to three particles, and that the usual unfolding semantics of replication can be replaced by three simple reduction rules. To illustrate the results and show how the calculus can be efficiently implemented we present a graphic representation of agents in the solos calculus, adapting ideas from interaction diagrams and pi-nets.} ) @Proceedings(EXPRESS00 ,title = {EXPRESS '00: Expressiveness in Concurrency} ,booktitle = {Proceedings of EXPRESS'00} ,year = 2000 ,month = aug # { 21} ,address = {State College, USA} ,editor = {Luca Aceto and Bj{\"o}rn Victor} ,volume = 39 ,number = 1 ,url = {http://www.elsevier.nl/locate/entcs/volume39.html} ,series = "Electronic Notes in Theoretical Computer Science" ,publisher = {Elsevier Science Publishers} ) @TechReport(victor.yi:proceedings-nordic ,author = {Bj{\"o}rn Victor and Wang Yi (Eds.)} ,title = {Proceedings of the 11th Nordic Workshop on Programming Theory} ,institution = "Department of Information Technology, Uppsala University" ,year = 1999 ,number = {1999-008} ,month = oct ,url = {http://user.it.uu.se/nwpt99/proceedings/} ) @Proceedings(EXPRESS99 ,title = {EXPRESS '99: Expressiveness in Concurrency} ,booktitle = {Proceedings of EXPRESS '99} ,year = 1999 ,month = aug # { 23} ,address = {Eindhoven, The Netherlands} ,editor = {Ilaria Castellani and Bj{\"o}rn Victor} ,volume = 27 ,url = {http://www.elsevier.nl/locate/entcs/volume27.html} ,series = "Electronic Notes in Theoretical Computer Science" ,publisher = {Elsevier Science Publishers} ) @Article(laneve.victor:solos-concert ,author = {Cosimo Laneve and Bj{\"o}rn Victor} ,title = {Solos in Concert} ,journal = {Mathematical Structures in Computer Science} ,year = 2003 ,volume = 13 ,number = 5 ,pages = {657-683} ,month = oct ,url = {http://user.it.uu.se/~victor/tr/solos.shtml} ,keywords = {fusion calculus, minimality, expressiveness} ,abstract = {We present a calculus of mobile processes without prefix or summation, called the {\em solos calculus}. Using two different encodings, we show that the solos calculus can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but uses no additional operators. We also show that the expressive power of the solos calculus is still retained by the sub-calculus where actions carry at most two names. On the contrary, expressiveness is lost in the solos calculus without match and with actions carrying at most one name. } ) @InProceedings(laneve.victor:solos-concert-conf ,author = {Cosimo Laneve and Bj{\"o}rn Victor} ,title = {Solos in Concert} ,booktitle = {Proceedings of ICALP'99} ,year = 1999 ,pages = {513--523} ,volume = {1644} ,editor = {Ji{\v{r}{\'{\i}}} Wiederman and Peter van Emde Boas and Mogens Nielsen} ,series = {Lecture Notes in Computer Science} ,address = {Prague, Czech Republic} ,month = jul ,publisher = {Springer-Verlag} ,keywords = {fusion calculus, minimality, expressiveness} ,url = {http://user.it.uu.se/~victor/tr/solos.shtml} ,abstract = {We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but uses no additional operators.} ) @InProceedings(parrow.victor:tau-laws-fusion ,author = {Joachim Parrow and Bj{\"o}rn Victor} ,title = {The Tau-Laws of Fusion} ,booktitle = {Proceedings of CONCUR'98} ,month = sep ,editor = {Davide Sangiorgi and Robert de Simone} ,volume = 1466 ,publisher = {Springer-Verlag} ,series = {Lecture Notes in Computer Science} ,pages = {99-114} ,year = 1998 ,keywords = {fusion calculus, weak congruence, axiomatization} ,url = {http://user.it.uu.se/~victor/tr/taufusion.shtml} ) @InProceedings(victor.parrow:concurrent-constraints ,author = {Bj{\"o}rn Victor and Joachim Parrow} ,title = {Concurrent Constraints in the Fusion Calculus} ,booktitle = {Proceedings of ICALP '98} ,month = jul ,editor = {Kim G. Larsen and Sven Skyum and Glynn Winskel} ,volume = 1443 ,series = {Lecture Notes in Computer Science} ,publisher = {Springer-Verlag} ,pages = {455--469} ,year = {1998} ,keywords = {fusion calculus, concurrent constraints, rho-calculus, weak bisimulation, weak hyperequivalence, barbed bisimulation, barbed congruence} ,url = {http://user.it.uu.se/~victor/tr/ccfc.shtml} ) @InProceedings(parrow.victor:fusion-calculus ,author = {Joachim Parrow and Bj{\"o}rn Victor} ,title = {The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes} ,booktitle = {Proceedings of LICS '98} ,year = 1998 ,url = {http://user.it.uu.se/~victor/tr/fusion.shtml} ,month = jun ,organization = {IEEE} ,publisher = {Computer Society Press} ) @InProceedings(parrow.victor:update-calculus ,author = {Joachim Parrow and Bj{\"o}rn Victor} ,title = {The Update Calculus} ,booktitle = {Proceedings of AMAST'97} ,editor = {Michael Johnson} ,volume = 1349 ,series = {Lecture Notes in Computer Science} ,publisher = {Springer-Verlag} ,year = 1997 ,pages = {409-423} ,url = {http://user.it.uu.se/~victor/tr/upd.html} ,note = {Full version available as Technical report DoCS 97/93, Uppsala University} ) @InProceedings(victor.moller:mobility-workbench ,author = {Bj{\"o}rn Victor and Faron Moller} ,title = {The {M}obility {W}orkbench --- A Tool for the $\pi$-Calculus} ,booktitle = {Proceedings of CAV '94} ,editor = {David Dill} ,volume = {818} ,series = {Lecture Notes in Computer Science} ,publisher = {Springer-Verlag} ,year = {1994} ,pages = {428--440} ,url = {http://user.it.uu.se/~victor/tr/docs-tr-94-45.html} ) @InProceedings(victor.parrow:constraints-processes ,author = {Bj{\"o}rn Victor and Joachim Parrow} ,title = {Constraints as Processes} ,booktitle = {Proceedings of CONCUR '96} ,editor = {Ugo Montanari and Vladimiro Sassone} ,publisher = {Springer-Verlag} ,series = {Lecture Notes in Computer Science} ,volume = {1119} ,year = {1996} ,pages = {389--405} ,url = {http://user.it.uu.se/~victor/tr/casp.html} ) @PhDThesis(victor:verification-tool ,author = {Bj{\"o}rn Victor} ,title = {A Verification Tool for the Polyadic $\pi$-Calculus} ,institution = {Department of Computer Systems, Uppsala University, Sweden} ,year = {1994} ,month = {May} ,type = {Licentiate thesis} ,note = {Available as report {DoCS 94/50}} ,url = {http://user.it.uu.se/~victor/tr/docs-tr-94-50.html} ) @PhDThesis(victor:fusion-calculus ,author = {Bj{\"o}rn Victor} ,title = {The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes} ,school = {Dept.\ of Computer Systems, Uppsala University, Sweden} ,year = 1998 ,number = {98/98} ,month = jun ,url = {http://user.it.uu.se/~victor/thesis.shtml} ,abstract = {The fusion calculus is presented as a significant step towards a canonical calculus of concurrency. It simplifies and extends the pi-calculus of Milner, Parrow and Walker. The fusion calculus contains the polyadic pi-calculus as a proper subcalculus and thus inherits all its expressive power. In addition fusion contains actions akin to updating a shared state, and a scoping construct for bounding their effects. Therefore it is easier to represent computational models with shared state, including concurrent constraint formalisms. It is also easy to represent the so called strong reduction strategies in the lambda-calculus, involving reduction under abstraction. In the pi-calculus these tasks require elaborate encodings. The fusion calculus simplifies the pi-calculus by reducing the number of binding operators and the number of bisimulation equivalences, and by making input and output symmetric like in pure CCS. We attain a calculus where concepts from other models of computation are more easily expressed than in the pi-calculus, thereby taking a step towards a unified yet simple model of computation. In this thesis we present a broad foundational theory of the fusion calculus. We define its labelled and unlabelled operational semantics, and treat strong and weak bisimulation equivalences for both semantics in some detail, including complete axiom systems for finite terms. The equivalences are given symbolic characterizations, leading to algorithms and an automatic tool for equivalence checking. We demonstrate the expressive power of the fusion calculus to give simple encodings of foundational calculi for functional and concurrent constraint programming. } )

© Björn Victor Last modified: Fri, 16-Apr-1999 16:30 MEST