The following pages link to (Q3992568):
Displaying 50 items.
- A framework for compositional nonblocking verification of extended finite-state machines (Q262429) (← links)
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems (Q262437) (← links)
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- A connection between concurrency and language theory (Q265802) (← links)
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- Rational operational models (Q265819) (← links)
- Automata-theoretic semantics of idealized Algol with passive expressions (Q265826) (← links)
- Distributed probabilistic and quantum strategies (Q265835) (← links)
- Using transition systems to describe and predict the behaviour of structured excitable media (Q272779) (← links)
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Strategies as concurrent processes (Q283745) (← links)
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) (← links)
- A logic of separating modalities (Q290917) (← links)
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Regularity of normed PA processes (Q294692) (← links)
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Performance analysis of concurrent systems in algebra dtsiPBC (Q300304) (← links)
- Reversible client/server interactions (Q315298) (← links)
- Formal modelling and verification of GALS systems using GRL and CADP (Q315303) (← links)
- Modelling and verifying the AODV routing protocol (Q324632) (← links)
- Development of concurrent structural decentralised discrete event system using bisimulation concept (Q330298) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Combine and conquer: relating BIP and Reo (Q347371) (← links)
- Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← 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)
- Reactive Turing machines (Q393091) (← links)
- A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
- The homology of partial monoid actions and Petri nets (Q395664) (← links)
- Theory and computation of discrete state space decompositions for hybrid systems (Q397399) (← links)
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
- General quantitative specification theories with modal transition systems (Q404008) (← links)
- Relational properties of sequential composition of coalgebras (Q406463) (← links)
- Specifying termination in CSP (Q407510) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- Foundational aspects of multiscale modeling of biological systems with process algebras (Q418838) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- SAT-based verification for timed component connectors (Q433331) (← links)
- Rule formats for determinism and idempotence (Q433348) (← links)
- Finite abstractions for hybrid systems with stable continuous dynamics (Q434462) (← links)
- Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets (Q436361) (← links)
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} (Q440685) (← links)
- Approximating Markov processes through filtration (Q442296) (← links)
- Controller synthesis for safety and reachability via approximate bisimulation (Q445917) (← links)
