scientific article; zbMATH DE number 7559462
From MaRDI portal
Publication:5089269
DOI10.4230/LIPIcs.CONCUR.2020.6MaRDI QIDQ5089269
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2008.11499
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
process algebrarecursionlabelled transition systemsHennessy-Milner logiccomplete axiomatisationstime-outsmodal characterisationsreactive bisimulation semantics
Related Items (3)
Unnamed Item ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Removing redundant refusals: minimal complete test suites for failure trace semantics
Cites Work
- 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
- 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.
This page was built for publication:
