Add to ORKGAbstract—Nested Petri nets is an extension of Petri net formal-ism with net tokens for modelling multi-agent distributed systems with complex structure. While having a number of interesting properties, NP-nets have been lacking tool support. In this paper we present the NPNtool toolset for NP-nets which can be used to edit NP-nets models and check liveness in a compositional way. An algorithm to check m-bisimiliarity needed for compositional checking of liveness has been developed. Experimental results of the toolset usage for modelling and checking liveness of classical dinning philosophers problem are provided. Index Terms—Petri nets, nested Petri nets, multi-agent systems, compositionality, liveness I
Well-behaved SNC covers well-behaved and various classes of FC (free-choice) and is not included in ...
noteStructural model abstraction is a powerful technique for reducing the complexity of a state base...
In this paper we address the issues of modelling and verification of concurren- t systems subject to...
Abstract The question of modelling and verification of agent-oriented systems is our research area. ...
The nested Petri nets (NP-nets) are a nets-within-nets formalism convenient for modelling systems th...
Agent technology is widely recognized as a new paradigm for the design of concurrent software and sy...
With the increased scale of distributed computations the complexity of liveness proofs have increase...
Concurrent systems are frequently scrutinised using automated model checking, routinely using Petri ...
Solutions proposed for the longstanding problem of automatic decomposition of Petri nets into concur...
In the past two decades, multi-agent systems (MAS) have emerged as a new paradigm for conceptualizin...
A technique to describe and to verify distributed algorithms is suggested. This technique (based on ...
International audienceThe objective of this tutorial is to focus on one technique that is suitable f...
Institute for Computing Systems ArchitectureMost Petri net (PN) based modelling formalisms represent...
Characterising liveness using a structure based approach is a key issue in theory of Petri nets. In ...
Abstract. This paper introduces PeCAn, a tool supporting composi-tional verification of Petri nets. ...
Well-behaved SNC covers well-behaved and various classes of FC (free-choice) and is not included in ...
noteStructural model abstraction is a powerful technique for reducing the complexity of a state base...
In this paper we address the issues of modelling and verification of concurren- t systems subject to...
Abstract The question of modelling and verification of agent-oriented systems is our research area. ...
The nested Petri nets (NP-nets) are a nets-within-nets formalism convenient for modelling systems th...
Agent technology is widely recognized as a new paradigm for the design of concurrent software and sy...
With the increased scale of distributed computations the complexity of liveness proofs have increase...
Concurrent systems are frequently scrutinised using automated model checking, routinely using Petri ...
Solutions proposed for the longstanding problem of automatic decomposition of Petri nets into concur...
In the past two decades, multi-agent systems (MAS) have emerged as a new paradigm for conceptualizin...
A technique to describe and to verify distributed algorithms is suggested. This technique (based on ...
International audienceThe objective of this tutorial is to focus on one technique that is suitable f...
Institute for Computing Systems ArchitectureMost Petri net (PN) based modelling formalisms represent...
Characterising liveness using a structure based approach is a key issue in theory of Petri nets. In ...
Abstract. This paper introduces PeCAn, a tool supporting composi-tional verification of Petri nets. ...
Well-behaved SNC covers well-behaved and various classes of FC (free-choice) and is not included in ...
noteStructural model abstraction is a powerful technique for reducing the complexity of a state base...
In this paper we address the issues of modelling and verification of concurren- t systems subject to...