Reactive bisimulation semantics for a process algebra with timeouts
From MaRDI portal
Publication:2687033
DOI10.1007/s00236-022-00417-1OpenAlexW3080569247MaRDI QIDQ2687033
Publication date: 1 March 2023
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-022-00417-1
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transition system specifications with negative premises
- Bisimulation and divergence
- A complete inference system for a class of regular behaviours
- Specification-oriented semantics for communicating processes
- A timed model for communicating sequential processes
- Structured operational semantics and bisimulation as a congruence
- A complete axiomatisation for observational congruence of finite-state behaviours
- Recursion induction for real-time processes
- Testing equivalences for processes
- The meaning of negative premises in transition system specifications. II
- Ensuring liveness properties of distributed systems: open problems
- Coupled similarity: the first 32 years
- Off-the-shelf automated analysis of liveness properties for just paths
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Axiomatising divergence
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- Process Algebra
- Branching time and abstraction in bisimulation semantics
- Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.
- A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity