Affiliations: Faculty of Mathematics and Computer Science, Nicolaus
Copernicus University, Toruń, Poland. Institute of Applied Informatics,
State Higher School of Vocational Education, Elbl�g, Poland.
stodj@mat.uni.torun.pl | Faculty of Mathematics and Computer Science, Nicolaus
Copernicus University, Toruń, Poland. Institute of Computer
Science, Polish Academy of Sciences, Warszawa, Poland.
edoch@mat.uni.torun.pl
Note: [] Address for correspondence: Nicolaus Copernicus University,
Chopina 12/18, 87-100 Toruń, Poland
Abstract: We propose a trace-based approach to description behaviours of
concurrent systems. First, we define the independency relation induced by
arbitrary transition system, forming this way an asynchronous transition
system. Then we introduce the notion of traceability of transition systems and
study some decision problems, related to computing independency and deciding
traceability for basic classes of Petri nets. Main results: traceability is
decidable for place/transition nets and undecidable in broader classes of nets
– inhibitor, reset and transfer nets.
