Petri nets and resource bisimulation
Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn't change the Petri net's behavior. We define the relations of resource similarity and resource ...
N-axioms parallel unification
Mgumon and Mguk-rep have a complementary role in unification in the complexity class NC. Mgumon is the upper bound of the unification classes that fall in NC and whose inputs admit an unrestricted number of repeated variables. Mguk-rep is the upper ...
Modelling with hierarchical object Petri nets
Fehling's hierarchical Petri nets are a net modelling framework based on refinement and abstraction of nets. Object Petri nets are a Petri net-based method of encapsulation. We bring these two domains together in the new concept of hierarchical object ...
Synthesis of Petri net models: a rough set approach
The synthesis problem of concurrent data models from experimental tables based on rough set approach has earlier been discussed [14], [15]. Classical Petri nets have been used as a model for concurrency. In this paper we propose the nets with inhibitor ...
Verifying epistemic properties of multi-agent systems via bounded model checking
We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be ...
Using state equation to prove non-reachability in timed Petrinets
Non-reachability proofs in Timed Petrinets were usually done by proving the nonreachability within the underlying timeless net. However, in many cases this approach fails.In this paper, we present an approach to prove non-reachability within the actual ...
Reachability analysis for timed automata using partitioning algorithms
The paper presents a new method for checking reachability properties of Timed Automata. The idea consists in on-the-fly verification of a property on a pseudo-bisimulating model generated by a modified partitioning algorithm. Pseudo-bisimulating models ...
Checking reachability properties for timed automata via SAT
The paper deals with the problem of checking reachability for timed automata. The main idea consists in combining the well-know forward reachability algorithm and the Bounded Model Checking (BMC) method. In order to check reachability of a state ...
