scientific article; zbMATH DE number 1927586

MaRDI QIDQ4484511zbMATH OpenFDO

Authors Sławomir Lasota

Publication date 12 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2421/24210562.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Decidability of performance equivalence for basic parallel processes
• Publication:4490743
• scientific article; zbMATH DE number 1512608
• scientific article; zbMATH DE number 1701362
• scientific article; zbMATH DE number 1497782

Cited in

(8)

• Time-abstracted bisimulation: Implicit specifications and decidability
• Decidability of performance equivalence for basic parallel processes
• scientific article; zbMATH DE number 1479629 (Why is no real title available?)
• INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis
• Undecidability of performance equivalence of Petri nets
• scientific article; zbMATH DE number 7301461 (Why is no real title available?)
• Timed Basic Parallel Processes
• CONCUR 2005 – Concurrency Theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484511)