Refinement and Asynchronous Composition of Modal Petri Nets

DOI10.1007/978-3-642-29072-5_4zbMath1350.68201OpenAlexW190322477MaRDI QIDQ2889610

Serge Haddad, Dorsaf Elhog-Benzina, Rolf Hennicker

Publication date: 8 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29072-5_4

zbMATH Keywords

infinite-state systemasynchronous compositionmodal language specification and refinementmodal Petri netweak determinacy

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data ⋮ A compositional framework to the specification of service protocols controllability and substitutability ⋮ Modal Open Petri Nets

Uses Software

• MIO Workbench

This page was built for publication: Refinement and Asynchronous Composition of Modal Petri Nets