Failures semantics and deadlocking of modular Petri nets
From MaRDI portal
Publication:1101233
zbMath0642.68109MaRDI QIDQ1101233
Publication date: 1989
Published in: Acta Informatica (Search for Journal in Brave)
TCSPdeadlockfailures semanticscontext netsmodular construction of Petri netssubnetstheory of communicating sequential processes
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items
A compositional dataflow semantics for Petri nets, Fair testing, A fully abstract semantics for termination in Petri nets, A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories, Asynchronous communication of Petri Nets and the refinement of transitions, A linear-time-branching-time spectrum for behavioral specification theories, Failures semantics based on interval semiwords is a congruence for refinement, Basic observables for processes, Basic observables for processes, Observable liveness of Petri nets
