Coverability Synthesis in Parametric Petri Nets
DOI10.4230/LIPIcs.CONCUR.2017.10zbMath1442.68120OpenAlexW2963278150MaRDI QIDQ5111622
Anna Ingólfsdóttir, Yolanda Ortega-Mallén, I. Fábregas, Álvaro García-Pérez, Luca Aceto
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/2402.00982
process algebranominal setsrule formatsnominal structural operational semanticsnominal transition systemsscope opening
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- A new approach to abstract syntax with variable binding
- SOS formats and meta-theory: 20 years after
- A congruence rule format for name-passing process calculi
- A calculus of mobile processes. II
- A conservative look at operational semantics with variable binding
- An alternative formulation of operational conservativity with binding terms.
- Structural operational semantics and bounded nondeterminism
- A structural approach to operational semantics
- Nominal unification
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Nominal rewriting
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Nominal Sets
- Nominal Equational Logic
- Nominal SOS
- Formalising the pi-calculus using nominal logic
- A Nominal Axiomatization of the Lambda Calculus
- Nominal (Universal) Algebra: Equational Logic with Names and Binding
- Initial Algebra Semantics and Continuous Algebras
- Weak Nominal Modal Logic
- Variable binding operators in transition system specifications
This page was built for publication: Coverability Synthesis in Parametric Petri Nets
