Dynamic consistency in process algebra: from paradigm to ACP
Publication:541685
DOI10.1016/J.SCICO.2010.04.011zbMath1213.68398OpenAlexW2115704352WikidataQ114850291 ScholiaQ114850291MaRDI QIDQ541685
E. P. de Vink, L. P. J. Groenewegen, Suzana Andova
Publication date: 7 June 2011
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.04.011
verificationprocess algebraparadigmcollaborationdynamic consistencybranching bisimulationdynamic constraint
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) Theory of software (68N99)
Uses Software
Cites Work
- Integrating a formal method into a software engineering process with UML and Java
- Specification and Development of Interactive Systems
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics
- Reo: a channel-based coordination model for component composition
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamic consistency in process algebra: from paradigm to ACP