LOTOS

swMATH2961MaRDI QIDQ15497FDOQ15497

Author name not available (Why is that?)

Official website: http://cserg0.site.uottawa.ca/lotos/

Described by source

• An interpreter for LOTOS, a specification language for distributed systems

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Bundle event structures: a revised cpo approach.
• A theory of stochastic systems. II: Process algebra
• Modelling Divergence in Relational Concurrent Refinement
• Automatic verification of distributed systems: the process algebra approach.
• Essential transitions to bisimulation equivalences
• Analyzing the execution architecture of mobile phone software with colored Petri nets.
• TTL: A modular language for hardware/software systems design.
• Automatic verification of concurrent systems using a formula-based compositional approach
• On the expressiveness of choice quantification
• Metric semantics for true concurrent real time
• Automatizing parametric reasoning on distributed concurrent systems
• Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS
• Model-checking CSP-Z: Strategy, tool support and industrial application
• Handling feature interactions in the language for end system services
• Title not available (Why is that?)
• \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
• Title not available (Why is that?)
• Performance of pipelined asynchronous systems
• Strategies for consistency checking based on unification
• Analysis of a multimedia stream using stochastic process algebra
• On fairness notions in distributed systems. I: A characterization of implementability
• Lectures on Concurrency and Petri Nets
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
• Process algebra having inherent choice: revised semantics for concurrent systems
• Introducing extra operations in refinement
• Relational concurrent refinement. III: Traces, partial relations and automata
• A local approach for temporal model checking of Java bytecode
• A comprehensive study of the complexity of multiparty interaction
• Title not available (Why is that?)
• Revisiting sequential composition in process calculi
• On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
• Refinement, conformance and inheritance
• Introduction to concurrency theory. Transition systems and CCS
• Title not available (Why is that?)
• Parameterized verification of monotone information systems
• Specification styles in distributed systems design and verification
• Title not available (Why is that?)
• More relational concurrent refinement: traces and partial relations
• Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
• Rough set methods for the synthesis and analysis of concurrent processes
• Operational specification with joint actions: Serializable databases
• Complete sets of axioms for finite basic LOTOS behavioural equivalences
• Failure-equivalent transformation of transition systems to avoid internal actions
• Title not available (Why is that?)
• Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
• Title not available (Why is that?)
• Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
• A framework based on implementation relations for implementing LOTOS specifications
• Reduced models for efficient CCS verification
• Deriving graphical representations of process networks from algebraic expressions
• Embedding time granularity in a logical specification language for synchronous real-time systems
• Real-time specification and modeling with joint actions
• The expressive power of implicit specifications
• Title not available (Why is that?)
• The how and why of interactive Markov chains
• Nested-unit Petri nets
• LOTOS extended with probabilistic behaviours
• Process synchronisation as fusion
• Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
• A formal framework for viewpoint consistency
• Interactive Markov chains. And the quest for quantified quality
• Static slicing of explicitly synchronized languages
• Analysing neurobiological models using communicating automata
• Ready simulation for concurrency: it's logical!
• Verification of \(\mathrm{EB}^3\) specifications using CADP
• Towards action refinement for true concurrent real time
• A fully abstract model for the \(\pi\)-calculus.
• Process algebraic modelling of attentional capture and human electrophysiology in interactive systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modal logic for message passing processes
• Generating test sets from non-deterministic stream X-machines
• Building distributed controllers for systems with priorities
• A theory of processes with durational actions
• Title not available (Why is that?)
• Executable structural operational semantics in Maude
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
• Bisimilarity of open terms.
• Title not available (Why is that?)
• Modelling and verifying the AODV routing protocol
• Behavioral subtyping relations for active objects
• Selective mu-calculus and formula-based equivalence of transition systems
• Concurrency and composition in a stochastic world
• Relational concurrent refinement. II: Internal operations and outputs
• GreatSPN
• Refinement of actions in a real-time process algebra with a true concurrency model
• TTL
• Title not available (Why is that?)
• M-TREE
• Renew
• JACK
• CADP
• BPEL2oWFN
• Fiacre
• Atelier B
• STG
• System design of a CC-NUMA multiprocessor architecture using formal specification, model-checking, co-simulation, and test generation
• csp2B

This page was built for software: LOTOS