LOTOS

swMATH2961MaRDI QIDQ15497FDOQ15497

Author name not available (Why is that?)

Described by source

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

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

• A theory of stochastic systems. II: Process algebra
• Modelling Divergence in Relational Concurrent Refinement
• 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?)
• A Timed Process Algebra for Wireless Networks with an Application in Routing
• 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
• Model-checking CSP-Z: Strategy, tool support and industrial application
• 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?)
• 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
• A modal logic for message passing processes
• Title not available (Why is that?)
• Performance of pipelined asynchronous systems
• Generating test sets from non-deterministic stream X-machines
• Building distributed controllers for systems with priorities
• On fairness notions in distributed systems. I: A characterization of implementability
• Lectures on Concurrency and Petri Nets
• A theory of processes with durational actions
• More Relational Concurrent Refinement: Traces and Partial Relations
• The How and Why of Interactive Markov Chains
• From π-calculus to higher-order π-calculus — and back
• Title not available (Why is that?)
• Introducing extra operations in refinement
• Relational concurrent refinement. III: Traces, partial relations and automata
• 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?)
• Title not available (Why is that?)
• Revisiting sequential composition in process calculi
• Modelling and verifying the AODV routing protocol
• Behavioral subtyping relations for active objects
• On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
• Selective mu-calculus and formula-based equivalence of transition systems
• Relational concurrent refinement. II: Internal operations and outputs
• Refinement of actions in a real-time process algebra with a true concurrency model
• Title not available (Why is that?)
• System design of a CC-NUMA multiprocessor architecture using formal specification, model-checking, co-simulation, and test generation
• Refinement, conformance and inheritance
• On the use of MTBDDs for performability analysis and verification of stochastic systems.
• Automated compositional Markov chain generation for a plain-old telephone system
• Title not available (Why is that?)
• On the usability of process algebra: An architectural view
• Specification styles in distributed systems design and verification
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
• Relations among quantum processes: bisimilarity and congruence
• Rough set methods for the synthesis and analysis of concurrent processes
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• Fair testing
• Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
• Title not available (Why is that?)
• Concurrency and Composition in a Stochastic World
• Compositional failure-based semantic models for basic LOTOS
• Proving finiteness of CCS processes by non-standard semantics
• Reduced models for efficient CCS verification
• Equational rules for rewriting logic
• Title not available (Why is that?)
• Bundle event structures: a revised cpo approach.
• 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
• Distributed implementation of a process-algebra based programming language for embedded systems
• On the expressiveness of choice quantification
• Metric semantics for true concurrent real time
• Automatizing parametric reasoning on distributed concurrent systems
• Title not available (Why is that?)
• Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS
• Models and tools for managing development processes.
• Feature interactions in embedded control systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating diagnostic information for behavioral preorders
• Title not available (Why is that?)
• Architectural CCS
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Strategies for consistency checking based on unification
• Analysis of a multimedia stream using stochastic process algebra
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
• Process algebra having inherent choice: revised semantics for concurrent systems
• Title not available (Why is that?)

This page was built for software: LOTOS