LOTOS
From MaRDI portal
Software:15497
No author found.
Related Items (only showing first 100 items - show all)
On the expressiveness of choice quantification ⋮ Models and tools for managing development processes. ⋮ Feature interactions in embedded control systems ⋮ Verification of \(\mathrm{EB}^3\) specifications using CADP ⋮ Executable structural operational semantics in Maude ⋮ Behavioral complexity indicators for process algebra: The NKS approach ⋮ Automatizing parametric reasoning on distributed concurrent systems ⋮ A modal logic for message passing processes ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Modelling and verifying the AODV routing protocol ⋮ Compositional failure-based semantic models for basic LOTOS ⋮ \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes ⋮ Handling feature interactions in the language for end system services ⋮ Efficient symbolic computation of process expressions ⋮ Performance of pipelined asynchronous systems ⋮ Fair testing ⋮ Architectural CCS ⋮ Unnamed Item ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Essential transitions to bisimulation equivalences ⋮ Revisiting sequential composition in process calculi ⋮ Nested-unit Petri nets ⋮ Introduction to concurrency theory. Transition systems and CCS ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ Compositional equivalences based on open pNets ⋮ TTL: A modular language for hardware/software systems design. ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ Automatic verification of concurrent systems using a formula-based compositional approach ⋮ Static slicing of explicitly synchronized languages ⋮ Unnamed Item ⋮ Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems ⋮ Towards action refinement for true concurrent real time ⋮ Behavioral subtyping relations for active objects ⋮ Automated compositional Markov chain generation for a plain-old telephone system ⋮ Selective mu-calculus and formula-based equivalence of transition systems ⋮ Specification styles in distributed systems design and verification ⋮ A High-Level Language for Modeling Algorithms and Their Properties ⋮ A theory of processes with durational actions ⋮ Operational specification with joint actions: Serializable databases ⋮ Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous ⋮ The expressive power of implicit specifications ⋮ 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 ⋮ Complete sets of axioms for finite basic LOTOS behavioural equivalences ⋮ Automatic verification of distributed systems: the process algebra approach. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Failure-equivalent transformation of transition systems to avoid internal actions ⋮ A formal framework for viewpoint consistency ⋮ Building distributed controllers for systems with priorities ⋮ Analysis of a Multimedia Stream using Stochastic Process Algebra ⋮ Interactive Markov chains. And the quest for quantified quality ⋮ Concurrency and Composition in a Stochastic World ⋮ Unnamed Item ⋮ A local approach for temporal model checking of Java bytecode ⋮ On the usability of process algebra: An architectural view ⋮ Ready simulation for concurrency: it's logical! ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ The How and Why of Interactive Markov Chains ⋮ Unnamed Item ⋮ On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP ⋮ A Timed Process Algebra for Wireless Networks with an Application in Routing ⋮ Parameterized verification of monotone information systems ⋮ Analysing neurobiological models using communicating automata ⋮ Introducing extra operations in refinement ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ LOTOS extended with probabilistic behaviours ⋮ Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization ⋮ Event-based functional decomposition ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ Refinement, conformance and inheritance ⋮ Towards Performance Prediction of Compositional Models in Industrial GALS Designs ⋮ Strategies for consistency checking based on unification ⋮ Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability ⋮ Process synchronisation as fusion ⋮ Process algebraic modelling of attentional capture and human electrophysiology in interactive systems ⋮ A theory of stochastic systems. II: Process algebra ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators ⋮ Bundle event structures: a revised cpo approach. ⋮ Bisimilarity of open terms. ⋮ On fairness notions in distributed systems. I: A characterization of implementability ⋮ Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS ⋮ All Linear-Time Congruences for Familiar Operators ⋮ Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems ⋮ Analyzing the execution architecture of mobile phone software with colored Petri nets. ⋮ Equational rules for rewriting logic ⋮ Proving finiteness of CCS processes by non-standard semantics ⋮ Reduced models for efficient CCS verification ⋮ From π-calculus to higher-order π-calculus — and back ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Performance validation tools for software/hardware systems ⋮ Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
This page was built for software: LOTOS
