Communicating sequential processes
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Deciding equivalence-based properties using constraint solving
- On the decidability and complexity of the structural congruence for beta-binders
- A model of concurrency with fair merge and full recursion
- Highly automated formal proofs over memory usage of assembly code
- Compositional specification in rewriting logic
- Strong fairness and full abstraction for communicating processes
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- A complete rule for equifair termination
- A distributed algorithm to prevent mutual drift between n logical clocks
- Transformations for communication fairness in CSP
- scientific article; zbMATH DE number 7453187 (Why is no real title available?)
- Reflections on the future of concurrency theory in general and process calculi in particular
- Formal methods to improve public administration business processes
- Probabilistic verification of communication protocols
- Parallel solution of recurrences on a tree machine
- MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI
- A formal model for BPEL4WS description of Web service composition
- Process algebra and model checking
- Logical foundations for programming semantics
- Attempting guards in parallel: A data flow approach to execute generalized guarded commands
- Transactional events
- Symmetric electoral systems for ambient calculi
- Mitigating covert channels based on analysis of the potential for communication
- CPO semantics of timed interactive actor networks
- Equivalence is in the eye of the beholder
- A structural operational semantics for an Edison like language. II
- Strong types for coordinating active objects
- Action systems in incremental and aspect-oriented modeling
- Petri nets, algebras, morphisms, and compositionality
- Distributed deadlock detection
- Synchronous message passing: on the relation between bisimulation and refusal equivalence
- Parallel decision procedures for finite state automata
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- A fully abstract model for the exchange of information in multi-agent systems.
- CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- A case for a forward predicate transformer
- Towards a foundation for semantics in complete metric spaces
- Two normal form theorems for CSP programs
- An algebra of processes
- Rewriting with a nondeterministic choice operator
- Deciding the bisimilarity relation between Datalog goals
- Nivat's processes and their synchronization
- Sémantique asynchrone et comportements infinis en CPS
- Defining conditional independence using collapses
- Automated temporal reasoning about reactive systems
- Decidability results in automata and process theory
- The congenial talking philosophers problem in computer networks
- A semantic theory for value-passing processes based on the late approach
- Fairness in shared invocation servicing
- Relational properties of sequential composition of coalgebras
- Projection approaches to process mining using region-based techniques
- Contextual behavioural metrics
- An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
- Receptive process theory
- Labelled domains and automata with concurrency
- scientific article; zbMATH DE number 7449992 (Why is no real title available?)
- Conflict vs causality in event structures
- Some impossibility results in interprocess synchronization
- A shared memory algorithm and proof for the generalized alternative construct in CSP
- Conflict vs causality in event structures
- A mechanized theory of regular trees in dependent type theory
- scientific article; zbMATH DE number 1231594 (Why is no real title available?)
- An introduction to the regular theory of fairness
- Semantics of production systems
- A brief history of Timed CSP
- A hierarchy of domains for real-time distributed computing
- An exact schedulability test for real-time systems with abstract scheduler on multiprocessor platforms
- Verification of distributed programs using representative interleaving sequences
- A precongruence format for should testing preorder
- Operational semantics of a weak memory model with channel synchronization
- Topology in process calculus. I: Limit behaviour of agents
- Correct audit logging in concurrent systems
- A hardware independent parallel programming model
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- SOS rule formats for zero and unit elements
- Representation of computations in concurrent automata by dependence orders
- Distributed event algebras
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- A game-semantic model of computation
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- Synthesis of communicating process skeletons from temporal-spatial logic specifications
- Extensional Petri net
- A fluid analysis framework for a Markovian process algebra
- Interactive verification of architectural design patterns in FACTum
- scientific article; zbMATH DE number 7649945 (Why is no real title available?)
- A formal abstract framework for modelling and testing complex software systems
- Rewriting semantics of production rule sets
- A theory of timed automata
- Retracing CSP
- Axiomatic-like performance analysis (ALPA)
- Operational semantics of a weak memory model with channel synchronization
- \(\pi\)-calculus with noisy channels
- Compositional semantics for real-time distributed computing
- Fifty years of Hoare's logic
- Using formal methods with SysML in aerospace design and engineering
- Checking opacity and durable opacity with FDR
This page was built for publication: Communicating sequential processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162644)