A Relative Timed Semantics for BPMN

DOI10.1016/j.entcs.2009.06.029zbMath1347.68215OpenAlexW2063294547MaRDI QIDQ5179205

Peter Y. H. Wong, Jeremy Gibbons

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.029

zbMATH Keywords

verificationCSPrefinementworkflowbusiness processtimed semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Formalisations and applications of BPMN ⋮ Property specifications for workflow modelling ⋮ A Relative Timed Semantics for BPMN

Uses Software

• Z
• FDR2
• JViews

Cites Work

• Unnamed Item
• Responsiveness of interoperating components
• On the expressiveness of timed coordination models
• Contract Based Multi-party Service Composition
• A Relative Timed Semantics for BPMN

This page was built for publication: A Relative Timed Semantics for BPMN