From symbolic constraint automata to Promela

DOI10.1016/J.JLAMP.2022.100794OpenAlexW4288046669WikidataQ114159197 ScholiaQ114159197MaRDI QIDQ2168790FDOQ2168790

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)

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

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

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• Logic and calculi for all on the occasion of Luís Barbosa's 60th birthday

Uses Software

• SPIN
• Reo
• PROMELA
• VirtuosoNext

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)