scientific article; zbMATH DE number 4119656

MaRDI QIDQ4733431zbMATH OpenFDO

Authors Ernst-Rüdiger Olderog

Publication date 1989

zbMATH Keywords

CCSCOSYCSPlabelled placeoperational and compositional Petri net semanticsstrong bisimilaritytransition nets

Mathematics Subject Classification ID

Theory of operating systems (68N25) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Comparing Semantics Under Strong Timing of Petri Nets
• Concurrent bisimulations in Petri nets
• Petri nets and bisimulation
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• Undecidability of bisimilarity for Petri nets and some related problems

Cited in

(8)

• Correctness of concurrent processes
• Operational and denotational semantics for the box algebra
• Program composition via unification
• A study on team bisimulation and H-team bisimulation for BPP nets
• Concurrent bisimulations in Petri nets
• Compositional equivalences based on open pNets
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• Petri nets and bisimulation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733431)