The following pages link to (Q4941495):
Displaying 50 items.
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- Processes with infinite liveness requirements (Q383788) (← links)
- A process calculus with finitary comprehended terms (Q385508) (← links)
- SAT-based verification for timed component connectors (Q433331) (← links)
- Dynamic consistency in process algebra: from paradigm to ACP (Q541685) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Process algebras as support for sustainable systems of services (Q814902) (← links)
- Execution architectures for program algebra (Q881834) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Towards a process calculus for REST: current state of the art (Q902704) (← links)
- Program algebra with a jump-shift instruction (Q959050) (← links)
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP (Q1001805) (← links)
- Analysis of a distributed system for lifting trucks. (Q1400154) (← links)
- The cones and foci proof technique for timed transition systems (Q1607115) (← links)
- Process algebra and conditional composition (Q1607116) (← links)
- Equivalence of recursive specifications in process algebra (Q1607118) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- Modeling and verification of reconfigurable printing system based on process algebra (Q1721623) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Process algebra with strategic interleaving (Q2000000) (← links)
- An axiomatization for quantum processes to unifying quantum and classical computing (Q2010952) (← links)
- Probabilistic process algebra to unifying quantum and classical computing in closed systems (Q2010969) (← links)
- Entanglement in quantum process algebra (Q2010982) (← links)
- Formal verification for KMB09 protocol (Q2010986) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Matching logic explained (Q2035650) (← links)
- A structural approach to graph transformation based on symmetric Petri nets (Q2035652) (← links)
- Modelling of DNA mismatch repair with a reversible process calculus (Q2148904) (← links)
- A formal framework for distributed cyber-physical systems (Q2168791) (← links)
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations (Q2182663) (← links)
- Formal enforcement of security policies on concurrent systems (Q2275899) (← links)
- Correctness checking of a quantum protocol for reliable communications via feedback (Q2322281) (← links)
- Bisimilar and logically equivalent programs in PDL with parallel operator (Q2358700) (← links)
- A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal (Q2568979) (← links)
- A theory of stochastic systems. II: Process algebra (Q2575855) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- Towards Modelling of Local Reversibility (Q2822522) (← links)
- Defining Actions in Concurrent Declarative Programming (Q2841291) (← links)
- Independence Abstractions and Models of Concurrency (Q2961560) (← links)
- Modeling for Verification (Q3176361) (← links)
- A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus (Q3185762) (← links)
- (Q3385651) (← links)
- Algebra Unifies Operational Calculi (Q3455645) (← links)
- (Q5089269) (← links)
- Interleaving Strategies (Q5200118) (← links)
- A Formalization of Anonymity and Onion Routing (Q5862309) (← links)
- Inheritance of behavior (Q5943265) (← links)
- Linearization in parallel pCRL (Q5946027) (← links)
