A calculus of mobile processes, I
Information and Computation
Free choice Petri nets
Complexity results for 1-safe nets
Theoretical Computer Science
Information and Computation
Computability of Recursive Functions
Journal of the ACM (JACM)
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Comments on capabilities, limitations and “correctness” of Petri nets
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
PETRI NET LANGUAGE
Computation: finite and infinite machines
Computation: finite and infinite machines
Peer-to-peer form based web information systems
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
ReSpecT Nets: Towards an Analysis Methodology for ReSpecT Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Reduction rules for reset/inhibitor nets
Journal of Computer and System Sciences
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
A metamodeling approach to transform UML 2.0 sequence diagrams to Petri nets
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Petri nets for modelling metabolic pathways: a survey
Natural Computing: an international journal
Applying step coverability trees to communicating component-based systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Step coverability algorithms for communicating systems
Science of Computer Programming
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
Hi-index | 5.23 |
We investigate the problem of extending the analysis techniques developed for P/T systems to a proper subclass of P/T systems with inhibitor arcs. We start proposing an extension of the coverability tree construction to a subclass of P/T systems with inhibitor arcs, whose elements will be called henceforth primitive systems. We show that the coverability tree corresponding to a primitive system is finite and is a good representation of its behaviour; hence, it can be used as an analysis tool to check properties such as place boundedness, the existence of dead transitions and of a reachable marking larger than a given one. Then we provide an encoding of primitive systems in P/T systems, which permits to retrieve the firing sequences of the primitive system from the firing sequences of the corresponding P/T system. The close correspondence between the firing sequences of the two systems is used prove the decidability of reachability, deadlock and liveness for primitive systems. We also obtain that the model checking problem for the linear time -calculus and labelled primitive systems is decidable. We show that primitive systems coincide with the largest class of P/T systems with inhibitor arcs whose transition sequences can be simulated by a standard P/T system; we also show that in general the step behaviour of a primitive system cannot be simulated by any P/T system. These results are then used to investigate the expressiveness of inhibitor arcs regarding the class of generated languages.