LOTOS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Relational concurrent refinement. II: Internal operations and outputs
- Process algebraic modelling of attentional capture and human electrophysiology in interactive systems
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Specification styles in distributed systems design and verification
- 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
- LOTOS extended with probabilistic behaviours
- Strategies for consistency checking based on unification
- GreatSPN
- Proving finiteness of CCS processes by non-standard semantics
- Automatizing parametric reasoning on distributed concurrent systems
- SCADE
- TTL
- Essential transitions to bisimulation equivalences
- Wendy
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- 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
- TIMES
- mCRL2
- Towards action refinement for true concurrent real time
- MoDeST
- GreatSPN 1.7
- Behavioral subtyping relations for active objects
- StEAM
- BISIMULATOR
- M-TREE
- HOL/SPIN
- E-LOTOS
- PEPS
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
- Equational rules for rewriting logic
- libDDD
- On the validity of encodings of the synchronous in the asynchronous -calculus
- Renew
- JACK
- CADP
- A local approach for temporal model checking of Java bytecode
- On the usability of process algebra: An architectural view
- Parameterized verification of monotone information systems
- 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
- Analyzing the execution architecture of mobile phone software with colored Petri nets.
- On the expressiveness of choice quantification
- Models and tools for managing development processes.
- Feature interactions in embedded control systems
- A modal logic for message passing processes
- BPEL2oWFN
- Compositional failure-based semantic models for basic LOTOS
- Fiacre
- Architectural CCS
- Atelier B
- STG
- PROMELA
- Automated compositional Markov chain generation for a plain-old telephone system
- Selective mu-calculus and formula-based equivalence of transition systems
- Exp.Open
- csp2B
- All congruences below stability-preserving fair testing or CFFD
- Event-based functional decomposition
- 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
- FDR2
- Executable structural operational semantics in Maude
- Behavioral complexity indicators for process algebra: The NKS approach
- Efficient symbolic computation of process expressions
- Nested-unit Petri nets
- fc2tools
- Process synchronisation as fusion
- QualNet
- A theory of stochastic systems. II: Process algebra
- LOTOSphere
- Concurrency Workbench
- Petriweb
- Compositional equivalences based on open pNets
- Distributed implementation of a process-algebra based programming language for embedded systems
- scientific article; zbMATH DE number 1693441 (Why is no real title available?)
- Analysis of a multimedia stream using stochastic process algebra
- scientific article; zbMATH DE number 1696882 (Why is no real title available?)
- scientific article; zbMATH DE number 1696903 (Why is no real title available?)
- scientific article; zbMATH DE number 1696907 (Why is no real title available?)
- Rough set methods for the synthesis and analysis of concurrent processes
- A timed process algebra for wireless networks with an application in routing (extended abstract)
- ProBE
- Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Taking decisions late: end-based choice combined with action refinement
- Refinement of actions in a real-time process algebra with a true concurrency model
- All linear-time congruences for familiar operators
- Process algebra having inherent choice: revised semantics for concurrent systems
- A high-level language for modeling algorithms and their properties
- The how and why of interactive Markov chains
- DLC
- scientific article; zbMATH DE number 6115908 (Why is no real title available?)
- LNT2LOTOS
This page was built for software: LOTOS
