Decidability questions for fairness in Petri nets
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Decidability of a temporal logic problem for petri nets
IDTC Second international conference on Database theory
Composition of nets Via a communication medium
APN 90 Proceedings on Advances in Petri nets 1990
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Petri net algebra
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
On liveness preservation by composition of nets via a set of places
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Deciding service composition and substitutability using extended operating guidelines
Data & Knowledge Engineering
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Verification of programs with half-duplex communication
Information and Computation
Operating guidelines for finite-state services
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Systems and Software Verification: Model-Checking Techniques and Tools
Systems and Software Verification: Model-Checking Techniques and Tools
Modal interface theories for communication-safe component assemblies
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Monterey'08 Proceedings of the 15th Monterey conference on Foundations of Computer Software: future Trends and Techniques for Development
Synchronizability for verification of asynchronously communicating systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A trace-based service semantics guaranteeing deadlock freedom
Acta Informatica
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
| Hi-index | 0.00 |
We consider asynchronously composed I/O-Petri nets (AIOPNs) with built-in communication channels. They are equipped with a compositional semantics in terms of asynchronous I/O-transition systems (AIOTSs) admitting infinite state spaces. We study various channel properties that deal with the production and consumption of messages exchanged via the communication channels and establish useful relationships between them. In order to support incremental design we show that the channel properties considered in this work are preserved by asynchronous composition, i.e. they are compositional. As a crucial result we prove that the channel properties are decidable for AIOPNs.