Just testing

DOI10.1007/978-3-031-30829-1_24arXiv2212.08829OpenAlexW4366504110MaRDI QIDQ6091214

Robert J. van Glabbeek

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.08829

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mutex needs fairness
• Specification-oriented semantics for communicating processes
• Defining liveness
• Algebra of communicating processes with abstraction
• Appraising fairness in languages for distributed programming
• A calculus of communicating systems
• Testing equivalences for processes
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Contextual nets
• Abstract processes of place/transition systems
• Ensuring liveness properties of distributed systems: open problems
• Justness. A completeness criterion for capturing liveness properties (extended abstract)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• The Coarsest Precongruences Respecting Safety and Liveness Properties
• Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
• Time and Fairness in a Process Algebra with Non-blocking Reading
• A Theory of Communicating Sequential Processes
• Nets, Terms and Formulas
• Proving the Correctness of Multiprocess Programs
• Non sequential semantics for contextual P/T nets
• Divergence and fair testing
• Understanding Petri Nets
• Fairness and hyperfairness
• CONCUR 2005 – Concurrency Theory
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Modelling mutual exclusion in a process algebra with time-outs
• Enabling Preserving Bisimulation Equivalence