Tomasz Brengos

Tomasz Brengos

Auto-generated profile, based on publicly available information

Tomasz Brengos

Faculty of Mathematics and Information Science Warsaw University of Technology ul. Koszykowa 75 00-662 Warszawa Poland

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 June 2015 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
TBTomasz Brengos
Tomasz Brengos
The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose type is a monad. We show that the visible and invisible part of the functor can be handled internally inside a monadic structure. In the second part we introduce the notion of an ordered saturation monad, study its properties, and show that it allows us to present two approaches towards defining weak bisimulation for coalgebras and compare them. We support the framework presented in this paper by two main examples of models: labelled transition systems and simple Segala systems.

1 November 2015 in Journal of Logical and Algebraic Methods in Programming
Verified
Journal Article
Closed access
TBTomasz Brengos
Tomasz Brengos
MMMarino Miculan
Marino Miculan
MPMarco Peressotti
Marco Peressotti

20 August 2014
Verified
Book Chapter
Open access
PDF file
TBTomasz Brengos
Tomasz Brengos
In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-based systems with internal moves, namely: weak bisimulation and trace semantics. We continue our research on weak bisimulations for coalgebras over order enriched monads. The key notions used in this paper and proposed by us in our previous work are the notions of an order saturation monad and a saturator. A saturator operator can be intuitively understood as a reflexive, transitive closure operator. There are two approaches towards defining saturators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation together with trace semantics for coalgebras with internal steps.

1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Open access
PDF file
TBTomasz Brengos
Tomasz Brengos
The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction principle.

1 May 2010 in Algebra universalis
Verified
Journal Article
Open access
PDF file
TBTomasz Brengos
Tomasz Brengos
VTVěra Trnková
Věra Trnková
H. P. Gumm and T. Schröder stated a hypothesis that the preservation of preimages by a functor T for which |T1| = 1 is equivalent to the satisfaction of the class equality \({{\mathcal {HS}}(\tt {K}) = {\mathcal {SH}}(\tt {K})}\) for any class K of T-coalgebras. Although we were not able to find a full solution, our paper gives a positive answer to this problem for a very wide class of Set-endofunctors.

25 February 2014 in arXiv
Verified
Preprint
Open access
PDF file
TBTomasz Brengos
Tomasz Brengos
In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-based systems with internal moves, namely: weak bisimulation and trace semantics. We continue our research on weak bisimulations for coalgebras over order enriched monads. The key notions used in this paper and proposed by us in our previous work are the notions of an order saturation monad and a saturator. A saturator operator can be intuitively understood as a reflexive, transitive closure operator. There are two approaches towards defining saturators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation together with trace semantics for coalgebras with internal steps.