From symbolic constraint automata to Promela

DOI10.1016/J.JLAMP.2022.100794MaRDI QIDQ2168790zbMATH OpenOpenAlexWikidataFDO

Authors Hui Feng, Marcello M. Bonsangue, Benjamin Lion

Publication date 26 August 2022

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.jlamp.2022.100794

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Symbolic execution of Reo circuits using constraint automata
• Modeling component connectors in Reo by constraint automata
• Compositional failure-based equivalence of constraint automata
• Data optimizations for constraint automata
• Linear Temporal Logic of Constraint Automata

Cites work

• A brief history of process algebra
• A coinductive calculus of component connectors.
• A model of context-dependent component connectors
• A specification language for Reo connectors
• Actor-based model checking for software-defined networks
• Model checking data flows in concurrent network updates
• Modeling component connectors in Reo by constraint automata
• Overview of thirty semantic formalisms for Reo
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions

Cited in

(2)

• scientific article; zbMATH DE number 2081040 (Why is no real title available?)
• Logic and calculi for all on the occasion of Luís Barbosa's 60th birthday

Describes a project that uses

Uses Software

• VirtuosoNext
• PROMELA
• Reo
• SPIN

This page was built for publication: From symbolic constraint automata to Promela

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