The following pages link to LOTOS (Q15497):
Displaying 50 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- Modelling and verifying the AODV routing protocol (Q324632) (← links)
- Static slicing of explicitly synchronized languages (Q418185) (← links)
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
- Building distributed controllers for systems with priorities (Q541297) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Deriving graphical representations of process networks from algebraic expressions (Q685510) (← links)
- Embedding time granularity in a logical specification language for synchronous real-time systems (Q685609) (← links)
- Real-time specification and modeling with joint actions (Q685613) (← links)
- A formal framework for viewpoint consistency (Q698095) (← links)
- Interactive Markov chains. And the quest for quantified quality (Q701689) (← links)
- Analysing neurobiological models using communicating automata (Q736844) (← links)
- Introducing extra operations in refinement (Q736913) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Refinement, conformance and inheritance (Q751843) (← links)
- Reduced models for efficient CCS verification (Q816205) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- Handling feature interactions in the language for end system services (Q856947) (← links)
- Performance of pipelined asynchronous systems (Q864507) (← links)
- Fair testing (Q865623) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Introduction to concurrency theory. Transition systems and CCS (Q897107) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP (Q1001805) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Process algebraic modelling of attentional capture and human electrophysiology in interactive systems (Q1047214) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Specification styles in distributed systems design and verification (Q1177943) (← links)
- Operational specification with joint actions: Serializable databases (Q1193603) (← links)
- Complete sets of axioms for finite basic LOTOS behavioural equivalences (Q1199556) (← links)
- Failure-equivalent transformation of transition systems to avoid internal actions (Q1209375) (← links)
- LOTOS extended with probabilistic behaviours (Q1261318) (← links)
- Strategies for consistency checking based on unification (Q1283883) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- TTL: A modular language for hardware/software systems design. (Q1400574) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- Automatic verification of concurrent systems using a formula-based compositional approach (Q1403320) (← links)
- Towards action refinement for true concurrent real time (Q1424360) (← links)
- Behavioral subtyping relations for active objects (Q1426939) (← links)
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability (Q1575646) (← links)
- Equational rules for rewriting logic (Q1608925) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- A local approach for temporal model checking of Java bytecode (Q1776379) (← links)
- On the usability of process algebra: An architectural view (Q1781999) (← links)
- Parameterized verification of monotone information systems (Q1798673) (← links)
