Free choice Petri nets
Theoretical Computer Science
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
PN2: An Elementary Model for Design and Analysis of Multi-agent Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Petri Nets as Token Objects: An Introduction to Elementary Object Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Theoretical Aspects of Recursive Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Concurrency in mobile object net systems
Fundamenta Informaticae - Concurrency specification and programming
The Reachability Problem for Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Hornets: Nets within Nets Combined with Net Algebra
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Information and Computation
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Modelling mobility and mobile agents using nets within nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Nested nets for adaptive systems
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
High-level nets with nets and rules as tokens
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Reference and value semantics are equivalent for ordinary object petri nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Modelling mobility with petri hypernets
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |
We are concerned with (strongly deterministic) generalised state machines (GSMs), a restricted formalism of the nets-within-nets-family, and further restrict the involved nets to P- and T-nets. While GSMs with these restrictions are likely to be of little use in modelling applications, understanding them better might help in future attempts to analyse more sophisticated formalisms. We show that, given a strongly deterministic GSM where the system net and all object nets are P-nets, it is PSpace-complete to decide the reachability of a given marking. In past work we have already shown that the same restriction to T-nets remains solvable in polynomial time. We discuss this work in the context given here. At last we give some initial results concerning other combinations of restricting the system and/or the object nets to P- and/or T-nets. Throughout we also discuss the effect of dropping the restriction to strongly deterministic GSMs.