Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2851061
Jump to:navigation, search

zbMath1272.68256MaRDI QIDQ2851061

Tomáš Vojnar, Peter Habermehl

Publication date: 2 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105051984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)


Related Items

Regular model checking with regular relations, Learning to verify branching time properties, Concurrent Kleene algebra with observations: from hypotheses to completeness, Learning Meets Verification, Three optimizations for assume-guarantee reasoning with \(L^{*}\), Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates, Computable fixpoints in well-structured symbolic model checking, Polynomial Identification of $$\omega $$-Automata, Tree regular model checking: a simulation-based approach, On Verifying Fault Tolerance of Distributed Protocols, Reachability Games on Automatic Graphs, Finite reasons for safety



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2851061&oldid=15786133"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki