Add to ORKGIn this paper we present Coloured Petri Nets and occurrence graphs with symmetries as a means for verification of distributed systems. The basic idea in the approach is to exploit the symmetries inherent in some distributed systems to construct a condensed state space. A newly developed computer tool that supports the method is presented. We use the tool to verify a non-trivial example: Lamport’s Fast Mutual Exclusion Algorithm. The paper is to a large exten
International audienceFormal verification of complex systems using high-level Petri Nets faces the s...
International audienceIn distributed environments, the shared resources access control by mutual exc...
This thesis enters in the frame of the automatic verification of concurrent software based on an int...
In this paper, we present a new computer tool for verification of distributed systems. As an example...
In this paper, we present a new computer tool for verification of distributed systems. As an example...
This paper recalls the concept of occurrence graphs with permuta-tion symmetries (OS-graphs) for Col...
[[abstract]]A colored generalized stochastic Petri net (CGSPN) model was used to study the correctne...
In this paper we argue that high-level Petri nets are well suited for the representation of distribu...
Distributed systems are difficult to design and the simplest of them can have subtle errors. Convent...
State-space reduction techniques for distributed discrete-event systems are normally based on detect...
Coloured Petri nets have proved to be a useful formalism for modeling distributed algorithms, i.e., ...
State-space based techniques represent a powerful analysis tool of discrete-event systems. One way t...
Most analysis techniques for discrete-event systems rely on building the system state-transition gra...
The paper presents a new analysis method for a class of concurrent systems which are formed of sever...
Abstract. Coloured Petri nets have proved to be a useful formalism for modeling distributed algorith...
International audienceFormal verification of complex systems using high-level Petri Nets faces the s...
International audienceIn distributed environments, the shared resources access control by mutual exc...
This thesis enters in the frame of the automatic verification of concurrent software based on an int...
In this paper, we present a new computer tool for verification of distributed systems. As an example...
In this paper, we present a new computer tool for verification of distributed systems. As an example...
This paper recalls the concept of occurrence graphs with permuta-tion symmetries (OS-graphs) for Col...
[[abstract]]A colored generalized stochastic Petri net (CGSPN) model was used to study the correctne...
In this paper we argue that high-level Petri nets are well suited for the representation of distribu...
Distributed systems are difficult to design and the simplest of them can have subtle errors. Convent...
State-space reduction techniques for distributed discrete-event systems are normally based on detect...
Coloured Petri nets have proved to be a useful formalism for modeling distributed algorithms, i.e., ...
State-space based techniques represent a powerful analysis tool of discrete-event systems. One way t...
Most analysis techniques for discrete-event systems rely on building the system state-transition gra...
The paper presents a new analysis method for a class of concurrent systems which are formed of sever...
Abstract. Coloured Petri nets have proved to be a useful formalism for modeling distributed algorith...
International audienceFormal verification of complex systems using high-level Petri Nets faces the s...
International audienceIn distributed environments, the shared resources access control by mutual exc...
This thesis enters in the frame of the automatic verification of concurrent software based on an int...