The following pages link to (Q3777424):
Displaying 50 items.
- A framework for compositional nonblocking verification of extended finite-state machines (Q262429) (← links)
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Automata-theoretic semantics of idealized Algol with passive expressions (Q265826) (← links)
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) (← links)
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- Modelling and verifying the AODV routing protocol (Q324632) (← links)
- Rigorous development of component-based systems using component metadata and patterns (Q333322) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← links)
- Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- A distributed resource allocation algorithm for many processes (Q378202) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- Processes with infinite liveness requirements (Q383788) (← links)
- A process algebra framework for multi-scale modelling of biological systems (Q388145) (← links)
- A cylinder computation model for many-core parallel computing (Q391222) (← links)
- Model of distributed computing system operation with time (Q395266) (← links)
- An algebraic theory of interface automata (Q402131) (← links)
- Specifying termination in CSP (Q407510) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- The sweep-line state space exploration method (Q418783) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
- Rule formats for determinism and idempotence (Q433348) (← links)
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets (Q436361) (← links)
- Mechanical reasoning about families of UTP theories (Q436368) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} (Q440685) (← links)
- Observable behavior of distributed systems: component reasoning for concurrent objects (Q444466) (← links)
- A dynamic deontic logic for complex contracts (Q444496) (← links)
- Static analysis of IMC (Q444504) (← links)
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity (Q458130) (← links)
- Book review of: Robin Sharp, Principles of protocol design (Q458502) (← links)
- Domain science and engineering from computer science to the sciences of informatics. II: Science (Q464883) (← links)
- A sound and complete reasoning system for asynchronous communication with shared futures (Q465485) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Reasoning about orchestrations of web services using partial correctness (Q469344) (← links)
- Model checking RAISE applicative specifications (Q470000) (← links)
- Threaded behavior protocols (Q470016) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Multi-parameterised compositional verification of safety properties (Q498394) (← links)
- Compositional synthesis of supervisors in the form of state machines and state maps (Q503186) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Modeling concurrency with interval traces (Q515576) (← links)
- Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
- Manifest domains: analysis and description (Q520235) (← links)
- Refining autonomous agents with declarative beliefs and desires (Q520236) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
