On Trace-Expressible Behaviour of Petri Nets

Authors:
Joanna Jółkowska;Edward Ochmański
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. ...;(Correspd.) Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland. Institute of Computer Science, Polish Academy of Sciences, Warszawa, Poland. edoch@mat. ...
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 9
Cited 0

Concurrent transition systems

Theoretical Computer Science
Formal verification of parallel programs

Communications of the ACM
Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Place or Transition Petri Nets

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Elementary Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem

Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computation: finite and infinite machines

Computation: finite and infinite machines

Quantified Score

Hi-index	0.00

Visualization

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.