A Set-Theoretic Model for a Typed Polymorphic Lambda Calculus - A Contribution to MetaSoft. - Andrzej M. Borzyszkowski; Ryszard Kubiak; Stefan Sokolowski (VDM Europe, 1988)

Understanding an informal Description: Office Documents Architecture, an ISO Standard. - Andrzej M. Borzyszkowski; Stefan Sokolowski (VDM Europe, 1988)

Recursive Definitions Revisited. - Marek A. Bednarczyk; Andrzej M. Borzyszkowski; Wieslaw Pawlowski (VDM Europe, 1990)

Towards the Semantics of the Definitional Language of MetaSoft. - Marek A. Bednarczyk; Andrzej M. Borzyszkowski; Wieslaw Pawlowski (VDM Europe, 1990)

CPO's do not form a CPO, and yet Recursion Works. - Marek A. Bednarczyk; Andrzej M. Borzyszkowski (VDM Europe (1), 1991)

General Morphisms of Petri Nets (Extended Abstract). - Marek A. Bednarczyk; Andrzej M. Borzyszkowski (ICALP, 1999)

Concurrent Realizations of Reactive Systems. - Marek A. Bednarczyk; Andrzej M. Borzyszkowski (CTCS, 1999)

Finite Completeness of Categories of Petri Nets. - Marek A. Bednarczyk; Andrzej M. Borzyszkowski; Rafal Somla (Fundam. Informaticae, 2000)

On Concurrent Realization of Reactive Systems and Their Morphisms. - Marek A. Bednarczyk; Andrzej M. Borzyszkowski (Unifying Petri Nets, 2001)

Transition systems without transitions. - Andrzej M. Borzyszkowski; Philippe Darondeau (Theor. Comput. Sci., 2005)

Concurrent Secrets. - Éric Badouel; Marek A. Bednarczyk; Andrzej M. Borzyszkowski; Benoît Caillaud; Philippe Darondeau (Discret. Event Dyn. Syst., 2007)

Computing majority via multiple queries. - Andrzej M. Borzyszkowski (Theor. Comput. Sci., 2014)

Regular Orthomodular Posets. - Andrzej M. Borzyszkowski (Fundam. Informaticae, 2019)