Modeling and analysis of communicating systems
From MaRDI portal
communicating systemsparallel processessequential processtimed process behaviorverification of distributed systemsverification of modal formulas
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network design and communication in computer systems (68M10) Network protocols (68M12) Distributed systems (68M14) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Recommendations
Cited in
(61)- On the validity of encodings of the synchronous in the asynchronous -calculus
- Verification of asynchronous systems with an unspecified component
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- A logic for the stepwise development of reactive systems
- On the expressiveness of multiplicities in data-based coordination languages
- Connecting open systems of communicating finite state machines
- Ensuring liveness properties of distributed systems: open problems
- Hybrid dynamic logic institutions for event/data-based systems
- A set automaton to locate all pattern matches in a term
- Compositional verification of concurrent systems by combining bisimulations
- Specification of systems with parameterised events: An institution-independent approach
- Natural projection as partial model checking
- Models and complexity of problems of design and reconstruction of telecommunication and transport systems
- Towards `up to context' reasoning about higher-order processes
- Model checking mobile ad hoc networks
- Logical characterisations, rule formats and compositionality for input-output conformance simulation
- An efficient algorithm to determine probabilistic bisimulation
- Decomposing monolithic processes in a process algebra with multi-actions
- A probabilistic analysis of the Game of the Goose
- Process algebra and model checking
- Dynamic logic with binders and its application to the development of reactive systems
- Distribution of behaviour into parallel communicating subsystems
- Input-output conformance testing for software product lines
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Static Analysis of Dynamic Communication Systems by Partner Abstraction
- To the correction of analytical models for computer based communication systems
- scientific article; zbMATH DE number 47515 (Why is no real title available?)
- scientific article; zbMATH DE number 51848 (Why is no real title available?)
- scientific article; zbMATH DE number 58291 (Why is no real title available?)
- scientific article; zbMATH DE number 2050824 (Why is no real title available?)
- scientific article; zbMATH DE number 7453962 (Why is no real title available?)
- scientific article; zbMATH DE number 7471704 (Why is no real title available?)
- Exploring type-level bisimilarity towards more expressive multiparty session types
- Divergence and unique solution of equations
- scientific article; zbMATH DE number 7269247 (Why is no real title available?)
- Collaboration vs. choreography conformance in BPMN
- Divergence and unique solution of equations
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- Modeling software behavior: A craftsman's approach.
- Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints
- Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude
- Modelling mutual exclusion in a process algebra with time-outs
- revTPL: The Reversible Temporal Process Language
- Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Can we communicate? Using dynamic logic to verify team automata
- Understanding Behaviour of Distributed Systems Using mCRL2
- Practical abstractions for automated verification of message passing concurrency
- Simplifying process parameters by unfolding algebraic data types
- A case in point: verification and testing of a EULYNX interface
- Infinite choice and probability distributions. An open problem: the real hotel
- Decomposing monolithic processes in a process algebra with multi-actions
- Progress, justness and fairness in modal -calculus formulae
- Real equation systems with alternating fixed-points
- Process-algebraic models of multi-writer multi-reader non-atomic registers
- Unfolding state variables improves model checking performance
- Minimal depth distinguishing formulas without until for branching bisimulation
- Just verification of mutual exclusion algorithms
- A state-based O(m n) partitioning algorithm for branching bisimilarity
- Revisiting sequential composition in process calculi
- Product line process theory
This page was built for publication: Modeling and analysis of communicating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191614)
