An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
From MaRDI portal
Publication:1785863
DOI10.1016/j.jlamp.2018.06.006zbMath1400.68133OpenAlexW2883210571MaRDI QIDQ1785863
Luis Llana, Rafael Martínez, Carlos Gregorio Rodríguez
Publication date: 1 October 2018
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.2018.06.006
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Logical characterisations, rule formats and compositionality for input-output conformance simulation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Observation equivalence as a testing equivalence
- CCS expressions, finite state processes, and three problems of equivalence
- Ready simulation for concurrency: it's logical!
- On the consistency of Koomen's fair abstraction rule
- A calculus of communicating systems
- Testing equivalences for processes
- From bisimulation to simulation: Coarsest partition problems
- On-the-fly conformance testing using SPIN
- A structural approach to operational semantics
- Transformational design and implementation of a new efficient solution to the ready simulation problem
- Abstract state machines, Alloy, B, TLA, VDM, and Z. 4th international conference, ABZ 2014, Toulouse, France, June 2--6, 2014. Proceedings
- Axiomatizing weak simulation semantics over BCCSP
- An efficient simulation algorithm on Kripke structures
- Unifying the Linear Time-Branching Time Spectrum of Process Semantics
- Modal logic and the approximation induction principle
- Logical Characterisations and Compositionality of Input-Output Conformance Simulation
- Correcting a Space-Efficient Simulation Algorithm
- Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
- Process algebra for synchronous communication
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- Process Algebra
- Bisimulation can't be traced
- Simulation-based minimization
- An Overview of the mCRL2 Toolset and Its Recent Advances
- Formal Approaches to Software Testing
