#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2001

2018

- This year (9)
- Last 5 years (20)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Bartek Klin, Vladimiro Sassone
- FoSSaCS
- 2008

A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeterministic processes.â€¦ (More)

- Bartek Klin
- Theor. Comput. Sci.
- 2011

Bialgebras and distributive laws are an abstract, categorical framework to study various flavors of Structural Operational Semantics. This papers aims to introduce the reader to the basics ofâ€¦ (More)

- Bartek Klin
- Semantics and Algebraic Specification
- 2009

Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A general rule format forâ€¦ (More)

- Bartek Klin
- Electr. Notes Theor. Comput. Sci.
- 2007

Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logics for theirâ€¦ (More)

- Bartek Klin, Vladimiro Sassone
- Inf. Comput.
- 2013

<lb>We introduce weighted GSOS, a general syntactic framework to specify well-behaved<lb>transition systems where transitions are equipped with weights coming from a commu-<lb>tative monoid. We proveâ€¦ (More)

- Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
- Logical Methods in Computer Science
- 2012

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory,â€¦ (More)

- Bartek Klin, Vladimiro Sassone, Pawel Sobocinski
- CALCO
- 2005

We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.

- Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
- 2011 IEEE 26th Annual Symposium on Logic inâ€¦
- 2011

Our motivating question is a My hill-Nerode theorem for infinite alphabets. We consider several kinds of those: alphabets whose letters can be compared only for equality, but also ones with moreâ€¦ (More)

- Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
- POPL
- 2012

Nominal sets are a different kind of set theory, with a more relaxed notion of finiteness. They offer an elegant formalism for describing lambda-terms modulo alpha-conversion, or automata on dataâ€¦ (More)

- Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
- 2013 28th Annual ACM/IEEE Symposium on Logic inâ€¦
- 2013

We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are weaker than nondeterministic ones; in particular, P6=NP in sets withâ€¦ (More)