Conjunction on processes: Full abstraction via ready-tree semantics
From MaRDI portal
conjunctionconsistency preorderfull abstractionlabelled transition systemready-tree preorderready-tree semantics
Temporal logic (03B44) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A logic for the description of non-deterministic programs and their properties
- A logical process calculus
- A logical view of composition
- A refinement calculus for specifications in Hennessy-Milner logic with recursion
- A Theory of Communicating Sequential Processes
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Bisimulation can't be traced
- Bisimulation through probabilistic testing
- Equivalence and preorder checking for finite-state systems
- Graphical versus logical specifications
- Handbook of process algebra
- scientific article; zbMATH DE number 4059362 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 2080212 (Why is no real title available?)
- scientific article; zbMATH DE number 4119599 (Why is no real title available?)
- Nets, Terms and Formulas
- Process-Algebraic Interpretations of Positive Linear and Relevant Logics
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- Testing equivalences for processes
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
Cited in
(13)- Encoding safety in \(\mathrm{CLL}_R\)
- On the greatest solution of equations in \(\mathrm{CLL}_R\)
- ACTL for modal interface automata
- Safe Reasoning with Logic LTS
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- An algebraic theory of interface automata
- Congruence from the operator's point of view: compositionality requirements on process semantics
- Ready Simulation for Concurrency: It’s Logical!
- Safe reasoning with logic LTS
- On recursive operations over logic LTS
- Foundations of Software Science and Computation Structures
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- Ready simulation for concurrency: it's logical!
This page was built for publication: Conjunction on processes: Full abstraction via ready-tree semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875513)
