scientific article

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

communication synchronization confluence concurrency determinacy process bisimulation bisimilarity

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (only showing first 100 items - show all)

Modelling and analysing neural networks using a hybrid process algebra ⋮ A connection between concurrency and language theory ⋮ History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Rational operational models ⋮ Automata-theoretic semantics of idealized Algol with passive expressions ⋮ Distributed probabilistic and quantum strategies ⋮ Using transition systems to describe and predict the behaviour of structured excitable media ⋮ Bisimilar and logically equivalent programs in PDL ⋮ Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Strategies as concurrent processes ⋮ Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ A logic of separating modalities ⋮ A non-SOS operational semantics for a process algebra ⋮ Regularity of normed PA processes ⋮ Algorithms for Kleene algebra with converse ⋮ Performance analysis of concurrent systems in algebra dtsiPBC ⋮ Reversible client/server interactions ⋮ Formal modelling and verification of GALS systems using GRL and CADP ⋮ Modelling and verifying the AODV routing protocol ⋮ Development of concurrent structural decentralised discrete event system using bisimulation concept ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Combine and conquer: relating BIP and Reo ⋮ Conflict-preserving abstraction of discrete event systems using annotated automata ⋮ Towards the hierarchical verification of reactive systems ⋮ Models for name-passing processes: Interleaving and causal ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Nested semantics over finite trees are equationally hard ⋮ A comparison of semantic models for noninterference ⋮ Weak bisimulation for probabilistic timed automata ⋮ Processes with infinite liveness requirements ⋮ Compositional analysis for linear systems ⋮ A process algebra framework for multi-scale modelling of biological systems ⋮ A cylinder computation model for many-core parallel computing ⋮ Translating FSP into LOTOS and networks of automata ⋮ Reactive Turing machines ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ The homology of partial monoid actions and Petri nets ⋮ On the potential advantages of exploiting behavioural information for contract-based service discovery and composition ⋮ Validation and verification of web services choreographies by using timed automata ⋮ Theory and computation of discrete state space decompositions for hybrid systems ⋮ Nominal abstraction ⋮ Undecidability of accordance for open systems with unbounded message queues ⋮ General quantitative specification theories with modal transition systems ⋮ Relational properties of sequential composition of coalgebras ⋮ Specifying termination in CSP ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ An algebra of behavioural types ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity ⋮ Foundational aspects of multiscale modeling of biological systems with process algebras ⋮ Bisimulations for fuzzy automata ⋮ Value-passing CCS with noisy channels ⋮ SAT-based verification for timed component connectors ⋮ Rule formats for determinism and idempotence ⋮ Finite abstractions for hybrid systems with stable continuous dynamics ⋮ Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets ⋮ Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} ⋮ Approximating Markov processes through filtration ⋮ Controller synthesis for safety and reachability via approximate bisimulation ⋮ First-order reasoning for higher-order concurrency ⋮ Bisimilarity enforcing supervisory control for deterministic specifications ⋮ Formal communication elimination and sequentialization equivalence proofs for distributed system models ⋮ HYPE: hybrid modelling by composition of flows ⋮ Threaded behavior protocols ⋮ A calculus of trustworthy ad hoc networks ⋮ Lattice-valued simulations for quantitative transition systems ⋮ Model-checking process equivalences ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Trace- and failure-based semantics for responsiveness ⋮ On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi ⋮ Monitoring and recovery for web service applications ⋮ Reversible session-based pi-calculus ⋮ Structural transformations for data-enriched real-time systems ⋮ An algebraic theory for web service contracts ⋮ Equivalence and generalization in a layered network model ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ Distributed supervisory control of discrete-event systems with communication delay ⋮ Rough approximations based on bisimulations ⋮ A language-independent proof system for full program equivalence ⋮ A language-based approach to modelling and analysis of Twitter interactions ⋮ An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems ⋮ A general account of coinduction up-to ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ Enabling synchronous and asynchronous communications in CSP for SOC ⋮ Model-checking games for fixpoint logics with partial order models ⋮ A semantic equivalence for Bio-PEPA based on discretisation of continuous values ⋮ Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm ⋮ Encoding cryptographic primitives in a calculus with polyadic synchronisation ⋮ Contexts, refinement and determinism ⋮ Contracts for security adaptation ⋮ On the axiomatizability of priority. II ⋮ SOS rule formats for zero and unit elements ⋮ Information hiding in probabilistic concurrent systems ⋮ Interface theories for concurrency and data ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Safe reasoning with logic LTS ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ On quasi-open bisimulation ⋮ A framework for compositional nonblocking verification of extended finite-state machines ⋮ \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems

This page was built for publication: