Titlebook: Application and Theory of Petri Nets and Concurrency; 45th International C Lars Michael Kristensen,Jan Martijn van der Werf Conference proc

極端的正確性

Moumita Ghosh,Lakshminarayan Satpatione message to all other processes or send it to at most one other process. In both cases, if no process can receive the message, it will still be sent. We establish a precise complexity class for two coverability problems with a parameterised number of processes: the state coverability problem and