Marek A. Bednarczyk

Learn More
Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers can ever find out that a trajectory of the system belongs to some secret. We search for a regular control on the system, enforcing the specified secrets on the observers, even though(More)
Petri hypernets, a novel framework for modeling mobile agents based on nets-within-nets paradigm is presented. Hypernets employ a local and finitary character of interactions between agents, and provide means for a modular and hierarchical description. They are capable of modelling mobile agents tfrahat can dynamically change their hierarchy, and can(More)
We present a model checking algorithm for alternating-time temporal logic (ATL) with imperfect information and imperfect recall. This variant of ATL is arguably most appropriate when it comes to modeling and speci cation of multi-agent systems. The related variant of model checking is known to be theoretically hard (∆2 to PSPACEcomplete, depending on the(More)
Two, seemingly different modular techniques for concurrent system development are investigated from a categorical perspective. A novel approach is presented in which they turn out to be merely special instances of pullback, a general categorical limit construction. Interestingly, the approach is based on truly concurrent semantics of systems. 1 Mathematical(More)
The purpose of this paper is to report on our experiments to use Isabelle a generic theorem prover as a universal environment within which speci cation development and veri cation of imperative programs can be performed The use of a theorem prover for the programming tasks is most appropriate when the processes of program speci cation development and veri(More)