From symbolic constraint automata to Promela

DOI10.1016/j.jlamp.2022.100794OpenAlexW4288046669WikidataQ114159197 ScholiaQ114159197MaRDI QIDQ2168790

Benjamin Lion, Hui Feng, Marcello M. Bonsangue

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

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• SPIN
• Reo
• PROMELA
• VirtuosoNext

Cites Work

• Unnamed Item
• A model of context-dependent component connectors
• A brief history of process algebra
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
• Actor-based model checking for software-defined networks
• Modeling component connectors in Reo by constraint automata
• A Specification Language for Reo Connectors
• Model Checking Data Flows in Concurrent Network Updates
• Recent Trends in Algebraic Development Techniques

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