scientific article; zbMATH DE number 4076638
From MaRDI portal
Publication:3806830
zbMATH Open0658.68070MaRDI QIDQ3806830FDOQ3806830
Authors: Heino Carstensen
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (8)
- Infinite behaviour of Petri nets
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
- \(X\)-automata on \(\omega\)-words
- Determinization of timed Petri nets behaviors
- Title not available (Why is that?)
- Infinite Process Semantics of Inhibitor Nets
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- On the high complexity of Petri nets \(\omega \)-languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806830)