Testing equivalences for processes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3810889 (Why is no real title available?)
- scientific article; zbMATH DE number 3688686 (Why is no real title available?)
- scientific article; zbMATH DE number 3694577 (Why is no real title available?)
- scientific article; zbMATH DE number 3754002 (Why is no real title available?)
- scientific article; zbMATH DE number 3757685 (Why is no real title available?)
- scientific article; zbMATH DE number 3765109 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3640837 (Why is no real title available?)
- A Powerdomain Construction
- A Theory of Communicating Sequential Processes
- A calculus of communicating systems
- A calculus of total correctness for communicating processes
- A term model for synchronous processes
- Algebraic semantics
- Communicating sequential processes
- Data Types as Lattices
- Distributed processes
- Initial Algebra Semantics and Continuous Algebras
- Power domains
- Semantics of nondeterminism, concurrency, and communication
- Universal types in concurrent Pascal
- Varieties of ordered algebras
Cited in
(only showing first 100 items - show all)- Formal Analysis of Dynamic, Distributed File-System Access Controls
- Deciding equivalence-based properties using constraint solving
- Process calculi as a tool for studying coordination, contracts and session types
- Linearity, persistence and testing semantics in the asynchronous pi-calculus
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Compliance in behavioural contracts: a brief survey
- A context dependent equivalence between processes
- An algebraic theory of fair asynchronous communicating processes
- Analysis of equivalence relations of event structures with continuous time
- On performance congruences for process algebras
- A partial ordering semantics for CCS
- Divergence in testing and readiness semantics
- Essential concepts of algebraic specification and program development
- Model-based testing of probabilistic systems
- On implementations and semantics of a concurrent programming language
- Axiomatizing weak ready simulation semantics over BCCSP
- Automatic verification of distributed systems: the process algebra approach.
- A Testing Theory for a Higher-Order Cryptographic Language
- Model independent approach to probabilistic models
- Testing equivalences of time Petri nets
- Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- A theory of monitors (extended abstract)
- Bisimulation on speed: a unified approach
- Testing congruence for mobile processes
- Soundness conditions for big-step semantics
- Observational structures and their logic
- Proof systems for infinite behaviours
- On real reward testing
- Verification of asynchronous systems with an unspecified component
- Testing probabilistic automata
- LOTOS extended with probabilistic behaviours
- On deciding trace equivalences for processes
- On the relative expressive power of calculi for mobility
- Testing processes for efficiency
- Full abstraction for expressiveness: history, myths and facts
- On the expressiveness of interaction
- Contexts, refinement and determinism
- Towards a complete hierarchy of compositional dataflow models
- CONFLICTS AND FAIR TESTING
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Concurrency and atomicity
- Liveness in timed and untimed systems
- An algebraic framework for developing and maintaining real-time systems
- Modular specification of process algebras
- Efficiency of asynchronous systems and read arcs in petri nets
- Conjunction on processes: Full abstraction via ready-tree semantics
- An introduction to the regular theory of fairness
- A process algebraic view of shared dataspace coordination
- Probabilistic bisimilarity as testing equivalence
- A precongruence format for should testing preorder
- Bisimulations in calculi modelling membranes
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Making random choices invisible to the scheduler
- Basic observables for processes
- Relating fair testing and accordance for service replaceability
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- Algebraic theory of probabilistic and nondeterministic processes.
- An algebraic theory for web service contracts
- A distributed operational semantics of CCS based on condition/event systems
- Compositional synthesis of maximally permissive supervisors using supervision equivalence
- Type theory and concurrency
- Strategies as concurrent processes
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- SOS formats and meta-theory: 20 years after
- Testing preorders for probabilistic processes.
- From rewrite rules to bisimulation congruences
- Testing preorders for probabilistic processes
- Testing preorders for probabilistic processes can be characterized by simulations
- Bisimulation on speed: Lower time bounds
- Finite axiom systems for testing preorder and De Simone process languages
- Abstract interface behavior of object-oriented languages with monitors
- A logical view of composition
- Equations, contractions, and unique solutions
- Fair refinement for asynchronous session types
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- First-order semantics for higher-order processes
- A formal abstract framework for modelling and testing complex software systems
- The calculus of context-aware ambients
- Concurrent testing of processes
- From computing to interaction: on the expressiveness of asynchronous pi-calculus
- scientific article; zbMATH DE number 3903949 (Why is no real title available?)
- Measuring the confinement of probabilistic systems
- Priorities in process algebras
- An invitation to friendly testing
- Quiescence, fairness, testing, and the notion of implementation
- Generating diagnostic information for behavioral preorders
- Structured operational semantics and bisimulation as a congruence
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Connectors as designs: modeling, refinement and test case generation
- An abstract framework for choreographic testing
- Contract-based discovery of Web services modulo simple orchestrators
- Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders
- Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder
- Performance of pipelined asynchronous systems
- On observational equivalence and algebraic specification
- An abstract framework for choreographic testing
- Asynchronous communication model based on linear logic
- A behavioural theory of first-order CML
This page was built for publication: Testing equivalences for processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348526)
