scientific article; zbMATH DE number 4039251
From MaRDI portal
Publication:3777424
Recommendations
Cited in
(only showing first 100 items - show all)- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Fully abstract models and refinements as tools to compare agents in timed coordination languages
- Refinement and verification in component-based model-driven design
- Probabilistic mobile ambients
- Processes with local and global liveness requirements
- Revivals, stuckness and the hierarchy of CSP models
- Generating priority rewrite systems for OSOS process languages
- (Bi)simulations up-to characterise process semantics
- Improving performance in flexible manufacturing systems
- Hardness of equivalence checking for composed finite-state systems
- A UTP semantics for \textsf{Circus}
- Relational concurrent refinement. II: Internal operations and outputs
- On the relationships between notions of simulation-based security
- A completed hierarchy of true concurrent equivalences
- Modelling and verification of delay-insensitive circuits using CCS and the concurrency workbench
- A CSP model with flexible parallel termination semantics
- An axiom system for sequence-based specification
- Process algebraic modelling of attentional capture and human electrophysiology in interactive systems
- Specification-oriented semantics for communicating processes
- Algebraic specification and proof of a distributed recovery algorithm
- Specification and verification of database dynamics
- A shared memory algorithm and proof for the generalized alternative construct in CSP
- On observability of discrete-event systems
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Designing equivalent semantic models for process creation
- A timed model for communicating sequential processes
- SIMD language design using prescriptive semantics
- Semantics and verification of monitors and systems of monitors and processes
- A state-based approach to communicating processes
- Metric semantics for concurrency
- On supervisory control of real-time discrete-event systems
- The equational theory of pomsets
- Introduction to the theory of nested transactions
- Type theory and concurrency
- A process-calculus-based abstraction for coordinating multi-agent groups
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- An incremental specification of the sliding-window protocol
- Design and verification of fault tolerant systems with CSP
- Correctness of concurrent processes
- Algebraic and fixed point equations over inverse limits of algebras
- Specification styles in distributed systems design and verification
- Connectedness and synchronization
- A proof system for communicating processes with value-passing
- Minimizing the number of transitions with respect to observation equivalence
- An agent calculus with simple actions where the enabling and disabling are derived operators
- Concurrent regular expressions and their relationship to Petri nets
- Semantics for data parallel computation
- A model of reconfiguration in communicating sequential processes with a notion of transactions
- On controllability and normality of discrete event dynamical systems
- Conditional rewriting logic as a unified model of concurrency
- The chemical abstract machine
- An algebraic approach to supervisory control
- Temporal theories as modularisation units for concurrent system specification
- Specifying modules to satisfy interfaces: A state transition system approach
- Experimenting with process equivalence
- Causal automata
- A compositional axiomatization of statecharts
- A calculus of mobile processes. I
- Complete sets of axioms for finite basic LOTOS behavioural equivalences
- Sequential to parallel buffer refinement
- Multitraces, hypertraces and partial order semantics
- An algebra for process creation
- TIC: a tImed calculus
- LOTOS extended with probabilistic behaviours
- Semantics of distributed definite clause programs
- The semantics of the combination of atomized statements and parallel choice
- Verified compilation of communicating processes into clocked circuits
- Liveness in timed and untimed systems
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
- An invitation to friendly testing
- A conservative look at operational semantics with variable binding
- Operational and denotational semantics for the box algebra
- The timed failures -- Stability model for CSP
- A complete equational axiomatization for MPA with string iteration
- A process algebra with distributed priorities
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- A calculus for cryptographic protocols: The spi calculus
- A general theory of action languages
- Basic observables for processes
- Distributed games
- On deciding trace equivalences for processes
- A complete modal proof system for HAL: the Herbrand agent language
- An abstract machine for concurrent modular systems: CHARM
- A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
- Nondeterminacy and recursion via stacks and games
- Object inheritance beyond subtyping
- The connection between an event structure semantics and an operational semantics for TCSP
- Infinitary parallelism without unbounded nondeterminism in CSP
- An efficiency preorder for processes
- Composition laws for entropy and temperature in tree-like graphs
- Axiomatic-like performance analysis (ALPA)
- An exercise in the automatic verification of asynchronous designs
- Recursion induction for real-time processes
- Process algebra with guards: Combining hoare logic with process algebra
- A semantic characterization for faults in replicated systems
- A specification-oriented semantics for the refinement of real-time systems
- GSOS and finite labelled transition systems
- Supervisory control using variable lookahead policies
- A fully abstract trace model for dataflow and asynchronous networks
- On sequential composition, action prefixes and process prefix
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)
