Dynamic consistency in process algebra: from paradigm to ACP
DOI10.1016/J.SCICO.2010.04.011zbMATH Open1213.68398OpenAlexW2115704352WikidataQ114850291 ScholiaQ114850291MaRDI QIDQ541685FDOQ541685
Authors: L. P. J. Groenewegen, Erik de Vink, S. 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
Recommendations
verificationprocess algebracollaborationdynamic consistencybranching bisimulationdynamic constraintparadigm
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of software (68N99) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Analysis of distributed systems with mCRL2
- Reo: a channel-based coordination model for component composition
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Handbook of process algebra
- Title not available (Why is that?)
- Branching time and abstraction in bisimulation semantics
- Title not available (Why is that?)
- Three logics for branching bisimulation
- Title not available (Why is that?)
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Specification and Development of Interactive Systems
- Integrating a formal method into a software engineering process with UML and Java
- Algebraic process verification.
- Formalizing adaptation on-the-fly
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: Dynamic consistency in process algebra: from paradigm to ACP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q541685)