Nets, Terms and Formulas
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
- Nets, sequential components and concurrency relations
- Concurrent nets: a study of prefixing in process calculi
- Concurrent nets: a study of prefixing in process calculi
- scientific article; zbMATH DE number 4128403
- scientific article; zbMATH DE number 4119609
- scientific article; zbMATH DE number 785044
- Paradigms of concurrency. Observations, behaviours and systems -- a Petri net view
- scientific article; zbMATH DE number 1184490
- scientific article; zbMATH DE number 3938548
Cited in
(63)- Processes with local and global liveness requirements
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
- A theory of structural stationarity in the \(\pi\)-calculus
- The analysis of concurrent systems. Cambridge, September 12-16, 1983. Proceedings
- Correctness of concurrent processes
- P/R nets and process concepts. I
- P/R nets and process concepts. II
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
- Basic observables for processes
- Model-checking discrete duration calculus
- The difference between splitting in \(n\) and \(n+1\)
- Petri nets, traces, and local model checking
- The box algebra = Petri nets + process expressions
- Petri nets and regular processes
- Ensuring liveness properties of distributed systems: open problems
- A study on team bisimulation and H-team bisimulation for BPP nets
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
- Team equivalences for finite-state machines with silent moves
- Team bisimilarity, and its associated modal logic, for BPP nets
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Verification of finite-state machines: a distributed approach
- Nested-unit Petri nets
- Process synchronisation as fusion
- Trace-oriented models of concurrency
- A theory for the composition of concurrent processes
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
- Encoding Asynchronous Interactions Using Open Petri Nets
- Ernst-Rüdiger Olderog: A Life for Meaning
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Language representability of finite P/T nets
- Ugo Montanari and Concurrency Theory
- Safe Reasoning with Logic LTS
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
- scientific article; zbMATH DE number 3921989 (Why is no real title available?)
- scientific article; zbMATH DE number 3938548 (Why is no real title available?)
- scientific article; zbMATH DE number 4055020 (Why is no real title available?)
- scientific article; zbMATH DE number 4085629 (Why is no real title available?)
- Processes with infinite liveness requirements
- scientific article; zbMATH DE number 17795 (Why is no real title available?)
- scientific article; zbMATH DE number 1955904 (Why is no real title available?)
- Solving recursive net equations
- A case study in transformational design of concurrent systems
- A refined view of the box algebra
- A Study on Team Bisimulations for BPP Nets
- Petri games: synthesis of distributed systems with causal memory
- Causal Semantics for BPP Nets with Silent Moves
- Interfaces between languages for communicating systems
- Safe reasoning with logic LTS
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets
- Divergence in testing and readiness semantics
- Just testing
- Synchronous development of asynchronous systems
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- Bisimulation, games, and logic
- An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
- Concurrent hyperproperties
- A multiset semantics for the pi-calculus with replication
- On the implementation of concurrent calculi in net calculi: two case studies
- Compositional verification of real-time applications
- Concurrent -hyperproperties
- Conjunction on processes: Full abstraction via ready-tree semantics
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- Ready simulation for concurrency: it's logical!
This page was built for publication: Nets, Terms and Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3997896)