Compact and efficiently verifiable models for concurrent systems

DOI10.1007/s10703-018-0316-0zbMath1425.68301OpenAlexW2761981939MaRDI QIDQ1620959

Andrey Mokhov, Hernán Ponce de León

Publication date: 15 November 2018

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=246561/5925BE35-7D60-4FEE-9E32-80E11C2EFB5A.pdf&pub_id=246561

zbMATH Keywords

concurrencypartial ordersevent structuresgraph transformation

Mathematics Subject Classification ID

Partial orders, general (06A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Uses Software

• Workcraft
• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Unfoldings: A partial-order approach to model checking.
• Building Bridges Between Sets of Partial Orders
• An Algorithm for Direct Construction of Complete Merged Processes
• Unfolding-Based Process Discovery
• Synthesis of Processor Instruction Sets from High-Level ISA Specifications
• Conditional Partial Order Graphs: Model, Synthesis, and Application
• Unfolding-based Partial Order Reduction

This page was built for publication: Compact and efficiently verifiable models for concurrent systems