Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrzej M. Borzyszkowski

dblp:87/6560 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0002-4477-8960ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal language operations
morphisms
0.011999
General Morphisms of Petri Nets (Extended Abstract) · ICALP 1999
Automata and formal languages
petri nets
0.011999
General Morphisms of Petri Nets (Extended Abstract) · ICALP 1999
YearPublicationVenuePosition
2019 Regular Orthomodular Posets
abstract
Rozenberg and Ehrenfeucht has shown a duality between 2-structures (a.k.a. transition systems) and (elementary) Petri nets. The tool has been the notion of a region of a 2-structure, the regions then define a Petri net. Bernardinello et al. has observed that the regions of a 2-structure form an orthomodular poset and there is a similar relation between 2-structures and orthomodular posets. While in the theory of 2-structures we may ask if a 2-structure is full and forward closed, the analogous notion for orthomodular posets is their regularity. In the present paper we study the problem of closing a given orthomodular poset to a regular one. This is a dual problem to closing a 2-structure, which has been studied by the author earlier. Also, as in a seminal work of Rozenberg and Ehrenfeucht, one can be interested in a concrete representation, i.e. as a family of sets. We show here an appropriate construction for orthomodular posets too.
Andrzej M. Borzyszkowski
Fundam. Informaticae1
2014 Computing majority via multiple queries
Andrzej M. Borzyszkowski
Theor. Comput. Sci.1
2005 Transition systems without transitions
Andrzej M. Borzyszkowski, Philippe Darondeau
Theor. Comput. Sci.1
2000 Finite Completeness of Categories of Petri Nets
abstract
The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. The main positive result of the paper states that reachable Petri nets with multiplicative morphisms form a finitely complete category. As an application of this result, some well-known categories are shown to be finitely complete. For instance, since all morphisms between reachable safe Petri nets are multiplicative, it follows that the category of reachable safe Petri nets is finitely complete.
Marek A. Bednarczyk, Andrzej M. Borzyszkowski, Rafal Somla
Fundam. Informaticae2
1999 General Morphisms of Petri Nets (Extended Abstract)
Marek A. Bednarczyk, Andrzej M. Borzyszkowski
ICALP2