Action Refinement in Process Algebra and Security Issues
From MaRDI portal
Publication:5504602
DOI10.1007/978-3-540-78769-3_14zbMath1179.68100OpenAlexW97395656MaRDI QIDQ5504602
Carla Piazza, Sabina Rossi, Annalisa Bossi
Publication date: 22 January 2009
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78769-3_14
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Information flow in systems with schedulers. II: Refinement ⋮ Action Refinement in Process Algebra and Security Issues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adding action refinement to a finite process algebra
- The difference between splitting in \(n\) and \(n+1\)
- A causal operational semantics of action refinement
- Comparing syntactic and semantic action refinement
- A Proof System for Information Flow Security
- Action Refinement in Process Algebra and Security Issues
- Program development by stepwise refinement
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: Action Refinement in Process Algebra and Security Issues