scientific article; zbMATH DE number 4039251
From MaRDI portal
Publication:3777424
Recommendations
Cited in
(only showing first 100 items - show all)- Extending MSVL with semaphore
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
- Comparing State Spaces in Automatic Security Protocol Analysis
- Resources in process algebra
- UTP semantics of reactive processes with continuations
- Model of distributed computing system operation with time
- Safe abstractions of data encodings in formal security protocol models
- Behavioral constraints for visual models
- Modelling web-service uncertainty: the angel/daemon approach
- Towards bridging time and causal reversibility
- Hyperformulae, parallel deductions and intersection types
- Key-ABS: a deductive verification tool for the concurrent modelling language ABS
- Probabilistic and prioritized models of timed CSP
- On supervisory control of real-time discrete-event systems
- RiskStructures: a design algebra for risk-aware machines
- Reactive Turing machines
- Metric semantics for concurrency
- On the stability of asynchronous iterative processes
- The box algebra = Petri nets + process expressions
- scientific article; zbMATH DE number 988156 (Why is no real title available?)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
- Processes with local and global liveness requirements
- Unbounded nondeterminism in CSP
- A wide-spectrum language for verification of programs on weak memory models
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Algebraic and fixed point equations over inverse limits of algebras
- scientific article; zbMATH DE number 1497789 (Why is no real title available?)
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- The semantics of the combination of atomized statements and parallel choice
- A compositional modelling and verification framework for stochastic hybrid systems
- Automated analysis of mutual exclusion algorithms using CCS
- Analysing a stream authentication protocol using model checking
- Equal to the task?
- An algebraic framework for urgency
- Verification of system level model transformations
- On the operating unit size of load/store architectures
- Divergence in testing and readiness semantics
- Specifications in stochastic process algebra for a robot control problem
- Quantales, observational logic and process semantics
- An algebraic theory of interface automata
- Process algebra and model checking
- Graph rewriting for a partial ordering semantics of concurrent constraints programming
- Deriving graphical representations of process networks from algebraic expressions
- The expressive power of implicit specifications
- Specification techniques for Markov reward models
- Algorithms for task allocation in ants. (A study of temporal polyethism: Theory)
- Adas and the equational theory of if-then-else
- A formal approach to open multiparty interactions
- A theory of stochastic systems. II: Process algebra
- On implementations and semantics of a concurrent programming language
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- A class of non-deterministic specifications for supervisory control
- Operational and denotational semantics for the box algebra
- A framework for compositional nonblocking verification of extended finite-state machines
- Axiomatizing weak ready simulation semantics over BCCSP
- The equational theory of weak complete simulation semantics over BCCSP
- Modelling and analysing neural networks using a hybrid process algebra
- Automata-theoretic semantics of idealized Algol with passive expressions
- Symmetric electoral systems for ambient calculi
- The laws of Occam programming
- Mitigating covert channels based on analysis of the potential for communication
- Enabling synchronous and asynchronous communications in CSP for SOC
- Modelling Divergence in Relational Concurrent Refinement
- Automatic verification of distributed systems: the process algebra approach.
- Failure-based equivalence of constraint automata
- Fairness and control in multi-agent systems
- Connection between logical and algebraic approaches to concurrent systems
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Constructing process categories
- scientific article; zbMATH DE number 1404761 (Why is no real title available?)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- Wait-free linearization with a mechanical proof
- Specification and verification of database dynamics
- A Theory of Communicating Sequential Processes
- Branching bisimulation congruence for probabilistic systems
- Synchronous message passing: on the relation between bisimulation and refusal equivalence
- A case study in transformational design of concurrent systems
- Process Calculi à la Bird-Meertens
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- The Birth of Model Checking
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- Neighbourhood message passing computation on a lattice with cP systems
- An algebraic semantics for hierarchical P/T nets
- A functorial semantics for observed concurrency
- Read-write causality
- CSP, partial automata, and coalgebras.
- A CSP model of Eiffel's SCOOP
- Resource traces: A domain for processes sharing exclusive resources.
- Discrete events and general systems theory
- scientific article; zbMATH DE number 7327941 (Why is no real title available?)
- The ARC programming model -- language constructs for coordination
- Temporal theories as modularisation units for concurrent system specification
- A new proposal of concurrent process calculus
- On the semantics of multistage interconnection networks
- Causal automata
- Semantics of non-terminating rewrite systems using minimal coverings
- Modal and temporal logics for processes
- Specification structures and propositions-as-types for concurrency
- Maurer computers for pipelined instruction processing
- Two case studies of semantics execution in Maude: CCS and LOTOS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777424)
