State space axioms for T-systems
From MaRDI portal
Publication:2340253
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Characterisation of the state spaces of marked graph Petri nets
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Synthesis and reengineering of persistent systems
- Analysis of Petri nets and transition systems
- Characterisation of the state spaces of live and bounded marked graph Petri nets
Cites work
- scientific article; zbMATH DE number 3471613 (Why is no real title available?)
- scientific article; zbMATH DE number 1302048 (Why is no real title available?)
- A decidability theorem for a class of vector-addition systems
- Applications and Theory of Petri Nets 2005
- Characterisation of the state spaces of live and bounded marked graph Petri nets
- Complexity of some problems in Petri nets
- Lectures on Concurrency and Petri Nets
- Marked directed graphs
- Synchronisationsgraphen
- Synthesis of Persistent Systems
Cited in
(7)- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- Target-oriented Petri net synthesis
- A new property of choice-free Petri net systems
- Presynthesis of bounded choice-free or fork-attribution nets
- Petri Net Synthesis for Restricted Classes of Nets
- Bounded choice-free Petri net synthesis: algorithmic issues
- Characterisation of the state spaces of marked graph Petri nets
This page was built for publication: State space axioms for T-systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340253)
