A trace-based service semantics guaranteeing deadlock freedom

DOI10.1007/s00236-012-0151-5zbMath1277.68206OpenAlexW2033436643MaRDI QIDQ2428498

Christian Stahl, Walter Vogler

Publication date: 26 April 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-012-0151-5

zbMATH Keywords

Petri netsaccordance preorderdeadlock freedomasynchronously communicating servicefinite-state servicesinfinite-state servicestrace-based semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Undecidability of accordance for open systems with unbounded message queues ⋮ Modal Open Petri Nets ⋮ Trace- and failure-based semantics for responsiveness

Uses Software

• BPEL2oWFN

Cites Work

• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Extensional equivalences for transition systems
• Fully abstract models of typed \(\lambda\)-calculi
• Testing equivalences for processes
• Trace and testing equivalence on asynchronous processes
• Compact Representations and Efficient Algorithms for Operating Guidelines
• The Must Preorder Revisited
• Operating Guidelines for Finite-State Services
• Deciding Substitutability of Services with Operating Guidelines
• A Theory of Communicating Sequential Processes
• Computer Aided Verification

This page was built for publication: A trace-based service semantics guaranteeing deadlock freedom